Information Sets From Defining Sets in Abelian Codes
- 8 September 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 57 (12) , 7990-7999
Abstract
We describe a technique to construct a set of check positions (and hence an information set) for every abelian code solely in terms of its defining set. This generalizes that given by Imai in in the case of binary TDC codes.Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- An intrinsical description of group codesDesigns, Codes and Cryptography, 2009
- Partial permutation decoding for codes from finite planesEuropean Journal of Combinatorics, 2005
- Permutation decoding of abelian codesIEEE Transactions on Information Theory, 1992
- On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their dualsIEEE Transactions on Information Theory, 1981
- Permutation decoding of certain triple-error-correcting binary codes (Corresp.)IEEE Transactions on Information Theory, 1972
- On permutation decoding of binary cyclic double-error-correcting codes of certain lengths (Corresp.)IEEE Transactions on Information Theory, 1970
- Semisimple cyclic and Abelian codes. IICybernetics and Systems Analysis, 1970
- Permutation Decoding of Systematic CodesBell System Technical Journal, 1964