Dual of codes over finite quotients of polynomial rings

DOI10.1016/J.FFA.2017.01.003MaRDI QIDQ2396764zbMATH OpenOpenAlexFDO

Authors Ashkan Nikseresht

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

zbMATH Keywords

polynomial ringalgebraic codingdual of a codebasis of divisors

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

Abstract: Let $A=fracmathbbF[x]langlef(x)angle$, where $f(x)$ is a monic polynomial over a finite field $mathbbF$. In this paper, we study the relation between $A$-codes and their duals. In particular, we state a counterexample and a correction to a theorem of Berger and El Amrani (Codes over finite quotients of polynomial rings, emph{Finite Fields Appl.} extbf{25} (2014), 165--181) and present an efficient algorithm to find a system of generators for the dual of a given $A$-code. Also we characterize self-dual $A$-codes of length 2 and investigate when the $mathbbF$-dual of $A$-codes are $A$-codes.

Recommendations

• Codes over finite quotients of polynomial rings
• Structure of dual codes over the finite chain ring \(R=F_p[u]/\langle u^k\rangle\) with length of \(p^sn\)
• Polynomial realization of sequential codes over finite fields
• scientific article; zbMATH DE number 4010392
• The dual code of any \((\delta + \alpha u^2)\)-constacyclic code over \(\mathbb{F}_{2^m} [u] \slash \langle u^4 \rangle\) of oddly even length

Cites work

• scientific article; zbMATH DE number 4023423 (Why is no real title available?)
• scientific article; zbMATH DE number 53946 (Why is no real title available?)
• scientific article; zbMATH DE number 1284416 (Why is no real title available?)
• A complete classification of ternary self-dual codes of length 24
• Algebraic structure of quasicyclic codes
• Bounds on the Size of Parity-Check Matrices for Quasi-Cyclic Low-Density Parity-Check Codes
• Codes over finite quotients of polynomial rings
• Constructing quasi-cyclic codes from linear algebra theory
• Duality for modules over finite rings and applications to coding theory
• LCD codes over finite chain rings
• On constacyclic codes over finite chain rings
• On quasi-cyclic codes as a generalization of cyclic codes
• On self-dual cyclic codes over finite chain rings
• On the algebraic structure of quasi-cyclic codes .I. Finite fields
• On the classification and enumeration of self-dual codes
• Self-dual codes over commutative Frobenius rings
• The classification of self-dual modular codes

Cited in

(3)

• Dual codes over direct products
• Codes over finite quotients of polynomial rings
• On \(\mathbb{Z}_2\mathbb{Z}_4\)-additive polycyclic codes and their Gray images

This page was built for publication: Dual of codes over finite quotients of polynomial rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2396764)