Performance of multiple-step (T,U) permutation decoding of cyclic codes

Author

Jia, Ming ; Le-Ngoc, Tho ; Benyamin-Seeyar, Anader

Author_Institution

Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada

fYear

1995

fDate

13-17 Nov 1995

Firstpage

1

Lastpage

5

Abstract

The performance of multiple-step (T,U) permutation decoding of cyclic codes is presented. First, the error-free gaps in a permuted error pattern are studied. It is shown that the gap-lengths in any two permuted error patterns are related by a linear mapping. Based on the characteristics of error-free gaps, the capability of multiple-step (T,U) permutation decoding of (n,k,2t+1) cyclic codes with odd t is examined. The bounds on the code rate of permutation-decodable binary cyclic codes are subsequently derived. It is shown that the code rate can be increased by increasing the number of U-permutations. For a permutation-decodable (n,k,2t+1) cyclic code, there is an optimum permutation step which makes the largest increase in its code rate. Examples are also given to illustrate the applications of the analytical results

Keywords

binary sequences; coding errors; cyclic codes; decoding; error statistics; binary cyclic codes; code rate bounds; error free gaps; gap lengths; linear mapping; multiple step permutation decoding; optimum permutation step; performance; permutation decodable cyclic code; permuted error pattern; Binary sequences; Cyclic codes; Decoding; Error analysis; Permutation codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 1995. Conference record. Communication Theory Mini-Conference, GLOBECOM '95., IEEE

Print_ISBN

0-7803-2509-5

Type

conf

DOI

10.1109/CTMC.1995.502921

Filename

502921