Characterization and enumeration of complementary dual abelian codes
- 8 November 2017
- journal article
- research article
- Published by Springer Nature in Journal of Applied Mathematics and Computing
- Vol. 58 (1-2) , 527-544
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Thailand Research Fund (MRG6080012)
This publication has 24 references indexed in Scilit:
- Quasi-abelian codesDesigns, Codes and Cryptography, 2013
- Multivariable Codes Over Finite Chain Rings: Serial CodesSIAM Journal on Discrete Mathematics, 2006
- Linear codes with complementary duals meet the Gilbert–Varshamov boundDiscrete Mathematics, 2004
- Cyclic and Negacyclic Codes Over Finite Chain RingsIEEE Transactions on Information Theory, 2004
- Split group codesIEEE Transactions on Information Theory, 2000
- The condition for a cyclic code to have a complementary dualDiscrete Mathematics, 1994
- Linear codes with complementary dualsDiscrete Mathematics, 1992
- Transform domain characterization of abelian codesIEEE Transactions on Information Theory, 1992
- Permutation decoding of abelian codesIEEE Transactions on Information Theory, 1992
- Local Group RingsCanadian Mathematical Bulletin, 1972