Title :
Exact lower bounds on the codelength of three-step permutation-decodable cyclic codes
Author :
Jia, Ming ; Benyamin-Seeyar, Anader ; LE-NGOC, THO
Author_Institution :
Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada
fDate :
11/1/1992 12:00:00 AM
Abstract :
The exact lower bounds on codelength n for three-step ( T, U) permutation decodable binary cyclic codes of even-valued error number t (t⩾4) are presented. Since the derivation of these results involves only the error position, the results are applicable to cyclic codes over GF(2m)
Keywords :
cyclic codes; decoding; error correction codes; binary cyclic codes; codelength; decoding; error trapping; even-valued error number; exact lower bounds; three-step permutation-decodable cyclic codes; Combinational circuits; Computer errors; Decoding; Error correction; Error correction codes; Information theory; Pattern matching; Polynomials;
Journal_Title :
Information Theory, IEEE Transactions on
