Dual of codes over finite quotients of polynomial rings
From MaRDI portal
Publication:2396764
DOI10.1016/j.ffa.2017.01.003zbMath1403.94111arXiv1605.03356OpenAlexW3103404807MaRDI QIDQ2396764
Publication date: 24 May 2017
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.03356
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Polynomials over finite fields (11T06)
Related Items (max. 100)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Self-dual codes over commutative Frobenius rings
- The classification of self-dual modular codes
- On quasi-cyclic codes as a generalization of cyclic codes
- A complete classification of ternary self-dual codes of length 24
- Constructing quasi-cyclic codes from linear algebra theory
- LCD codes over finite chain rings
- Codes over finite quotients of polynomial rings
- On self-dual cyclic codes over finite chain rings
- On constacyclic codes over finite chain rings
- Duality for modules over finite rings and applications to coding theory
- On the algebraic structure of quasi-cyclic codes .I. Finite fields
- Bounds on the Size of Parity-Check Matrices for Quasi-Cyclic Low-Density Parity-Check Codes
- On the classification and enumeration of self-dual codes
- Algebraic structure of quasicyclic codes
This page was built for publication: Dual of codes over finite quotients of polynomial rings