Code Automorphisms and Permutation Decoding of Certain Reed–Solomon Binary Images

@article{Lim2010CodeAA,
  title={Code Automorphisms and Permutation Decoding of Certain Reed–Solomon Binary Images},
  author={Fabian Lim and Marc P. C. Fossorier and Aleksandar Kavcic},
  journal={IEEE Transactions on Information Theory},
  year={2010},
  volume={56},
  pages={5253-5273}
}
We consider primitive Reed-Solomon (RS) codes over the field F2m of length n=2m-1. Building on Lacan 's results for the case of binary extension fields, we show that the binary images of certain two-parity symbol RS [n, n-2, 3] code, have a code automorphism subgroup related to the general linear group GL(m, 2). For these codes, we obtain a code automorphism subgroup of order m! GL(m,2). An explicit algorithm is given to compute a code automorphism (if it exists), that sends a particular choice… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 19 references

The q-ary image of a qm-ary cyclic code

IEEE Trans. Information Theory • 1995
View 6 Excerpts
Highly Influenced

The Theory of Error-Correcting Codes, 2nd ed

F. J. MacWilliams, N.J.A. Sloane
1983
View 10 Excerpts
Highly Influenced

Error Control Coding, 2nd ed

S. Lin, D. J. Costello
Upper Saddle River, NJ: Pearson Prentice-Hall, • 2000
View 7 Excerpts
Highly Influenced

Notes on the automorphism groups of Reed Solomon binary images

2008 IEEE International Symposium on Information Theory • 2008
View 5 Excerpts

A Low-Complexity Method for Chase-Type Decoding of Reed-Solomon Codes

2006 IEEE International Symposium on Information Theory • 2006
View 1 Excerpt

Similar Papers

Loading similar papers…