Back to Search
Start Over
From ds-Bounds for Cyclic Codes to True Minimum Distance for Abelian Codes.
- Source :
- IEEE Transactions on Information Theory; Mar2019, Vol. 65 Issue 3, p1752-1763, 12p
- Publication Year :
- 2019
-
Abstract
- In this paper, we develop a technique to extend any bound for the minimum distance of cyclic codes constructed from its defining sets (ds-bounds) to Abelian (or multivariate) codes through the notion of ${\mathbb B}$ -apparent distance. We also study conditions for an Abelian code to verify that its ${\mathbb B}$ -apparent distance reaches its (true) minimum distance. Then, we construct some codes as an application. [ABSTRACT FROM AUTHOR]
- Subjects :
- CYCLIC codes
CODING theory
MATRIX method (Indexing)
POLYNOMIALS
FOURIER transforms
Subjects
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 65
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 134886973
- Full Text :
- https://doi.org/10.1109/TIT.2018.2868446