# Step-By-Step Decoding of Alternant Codes

http://hdl.handle.net/10150/609903
Title:
Step-By-Step Decoding of Alternant Codes
Author:
Omidyar, C. G.; Helgert, H. J.
Affiliation:
The George Washington University
Issue Date:
1978-11
Rights:
Collection Information:
Proceedings from the International Telemetering Conference are made available by the International Foundation for Telemetering and the University of Arizona Libraries. Visit http://www.telemetry.org/index.php/contact-us if you have questions about items in this collection.
Publisher:
International Foundation for Telemetering
Journal:
International Telemetering Conference Proceedings
Abstract:
In this paper we present a decoding scheme for Alternant codes. The syndromes are calculated from the received vector and the parity check matrix H. Let t be the error correcting capability of the decoder. Then we determine a Key Equation by adding t columns of the parity check matrix H. We raise this equation t-1 times to the power of n, where n is the number of columns of H. Next we consider a matrix At whose elements are the set of coefficients from the Key Equations which we obtained. We make a decision based on the determinant of the matrix A(t). If the matrix A(t) is singular, then we test the matrix A(t-1) for singularity and continue up to A(t-t+1) which in fact the decoder can correct one error. if any one of the matrices A(t) through A(t-t+1) is nonsingular we change the first digit of the received vector, then recompute the syndromes and recheck Δt'. If Δt' is zero the change is retained. If not, the digit is changed again. The Algorithm then proceeds to the next digit. This Algorithm for decoding Alternant codes has significant improvements over previous schemes since the step-by-step decoding can be carried out at selected areas of the received word.
International Foundation for Telemetering
ISSN:
0884-5123; 0074-9079
http://www.telemetry.org/

DC FieldValue Language
dc.language.isoen_USen
dc.titleStep-By-Step Decoding of Alternant Codesen_US
dc.contributor.authorOmidyar, C. G.en
dc.contributor.authorHelgert, H. J.en
dc.contributor.departmentThe George Washington Universityen
dc.date.issued1978-11-
dc.description.collectioninformationProceedings from the International Telemetering Conference are made available by the International Foundation for Telemetering and the University of Arizona Libraries. Visit http://www.telemetry.org/index.php/contact-us if you have questions about items in this collection.en
dc.publisherInternational Foundation for Telemeteringen
dc.description.abstractIn this paper we present a decoding scheme for Alternant codes. The syndromes are calculated from the received vector and the parity check matrix H. Let t be the error correcting capability of the decoder. Then we determine a Key Equation by adding t columns of the parity check matrix H. We raise this equation t-1 times to the power of n, where n is the number of columns of H. Next we consider a matrix At whose elements are the set of coefficients from the Key Equations which we obtained. We make a decision based on the determinant of the matrix A(t). If the matrix A(t) is singular, then we test the matrix A(t-1) for singularity and continue up to A(t-t+1) which in fact the decoder can correct one error. if any one of the matrices A(t) through A(t-t+1) is nonsingular we change the first digit of the received vector, then recompute the syndromes and recheck Δt'. If Δt' is zero the change is retained. If not, the digit is changed again. The Algorithm then proceeds to the next digit. This Algorithm for decoding Alternant codes has significant improvements over previous schemes since the step-by-step decoding can be carried out at selected areas of the received word.en
dc.identifier.issn0884-5123-
dc.identifier.issn0074-9079-
dc.identifier.urihttp://hdl.handle.net/10150/609903-
dc.identifier.journalInternational Telemetering Conference Proceedingsen
dc.typetexten
dc.typeProceedingsen
dc.relation.urlhttp://www.telemetry.org/en