Repeated-root constacyclic codes of length <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>2</mml:mn><mml:msup><mml:mrow><mml:mi>ℓ</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:math>

Bocong Chen, Hai Q. Dinh, Hongwei LiuFinite 2014 · DOI

TL;DR

This paper provides a comprehensive characterization of constacyclic codes of length $2\ell^m p^n$ over finite fields, extending previous work on simpler code structures. The authors establish the generator polynomials for these codes and their duals, and then apply these findings to identify linear complementary dual (LCD) and self-dual negacyclic codes within this class.

What Problem Does This Paper Address?

Constacyclic codes are a generalization of cyclic codes, with applications in error correction and efficient encoding. While cyclic codes are well-understood, the structure of constacyclic codes can vary significantly depending on the "constacyclic multiplier" ($\lambda$) and the code length ($n$). This variation makes a complete classification challenging. Previous work has addressed specific code lengths and multipliers, but a general framework for longer, more complex lengths like $2\ell^m p^n$ (where $\ell$ and $p$ are distinct odd primes) was missing. This paper aims to fill that gap by providing a detailed structural analysis and classification of these codes, including their duals and special subclasses like LCD and self-dual codes.

Methods

The paper builds upon existing theory of finite fields and coding theory. Key techniques include:

  • Constacyclic Equivalence: The authors leverage the concept of $\lambda$-equivalence, which groups multipliers $\lambda$ that lead to constacyclic codes with equivalent algebraic structures. This significantly reduces the number of cases to analyze.
  • Irreducible Factorization: The core of the analysis involves finding the irreducible factorization of polynomials like $X^n - \lambda$ over finite fields. This is achieved by relating it to the factorization of $X^n - 1$ and $X^n + 1$, and utilizing cyclotomic cosets.
  • Generator Polynomials: The structure of constacyclic codes is determined by their generator polynomials. The paper derives these polynomials by relating them to the irreducible factors of $X^n - \lambda$.
  • Dual Codes: The dual of a constacyclic code is also constacyclic (with a different multiplier). The paper uses the property that the generator polynomial of the dual code is related to the reciprocal polynomial of the original code's generator polynomial.
  • LCD and Self-Dual Codes: These special classes of codes are identified by analyzing the intersection of a code with its dual ($C \cap C^\perp = \{0\}$ for LCD) and the condition $C = C^\perp$ for self-dual codes.

Datasets

Not discussed in the paper.

Key Insights and Ideas

  • Generalizing Structure: The paper successfully extends the classification of constacyclic codes to a more complex length ($2\ell^m p^n$), demonstrating that structural equivalences can still be found by grouping multipliers.
  • The Power of Irreducible Factorization: The entire analysis hinges on understanding the irreducible factors of $X^n - \lambda$. The paper shows how to systematically derive these factorizations for the given code length.
  • Dual Code Structure: The duals of constacyclic codes are not arbitrary; they maintain a constacyclic structure, which is explicitly characterized. This is crucial for identifying LCD and self-dual codes.
  • Conditions for LCD/Self-Dual Codes: The paper provides explicit conditions and generator polynomials for LCD and self-dual negacyclic codes within this class, revealing specific structural requirements.

Key Results

The paper provides detailed characterizations of:

  • Constacyclic Codes: For various cases of $\lambda$ and the relationship between $\ell$ and $q-1$, the generator polynomials of all constacyclic codes of length $2\ell^m p^n$ over $\mathbb{F}_q$ are determined.
  • Dual Codes: The generator polynomials for the duals of these constacyclic codes are explicitly given.
  • LCD Codes: The paper identifies all LCD cyclic and negacyclic codes of length $2\ell^m p^n$. For instance, it shows that LCD constacyclic codes with $\lambda \notin \{-1, 1\}$ are equivalent to cyclic or negacyclic codes.
  • Self-Dual Negacyclic Codes: The paper determines the conditions under which self-dual negacyclic codes exist for this length and provides their generator polynomials. It notably shows that self-dual cyclic codes do not exist for odd prime characteristics.

Limitations and Future Work

  • Complexity: The results, while comprehensive, involve intricate polynomial factorizations and numerous cases, making them computationally intensive to apply directly.
  • Specific Applications: While the paper establishes the theoretical structure, it doesn't delve into specific applications of these codes in practical coding scenarios.
  • Future Work: The authors' work naturally sets the stage for exploring the performance (e.g., distance properties) of these newly characterized codes and investigating their potential in specific communication or storage systems. Further research could also focus on extending these results to more general code lengths or finite rings.

Summary updated

BibTeX
@inproceedings{chen2014repeated,
  author = {Bocong Chen and Hai Q. Dinh and Hongwei Liu},
  title = {{Repeated-root constacyclic codes of length <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:mn>2</mml:mn><mml:msup><mml:mrow><mml:mi>ℓ</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup></mml:math>}},
  booktitle = {Finite},
  year = {2014},
  doi = {10.1016/j.ffa.2014.11.006},
}
Figure