On the minimal distance of a polynomial code

MaRDI QIDQ5414557zbMATH OpenFDO

Authors Péter Pál Pach, Csaba Szabó

Publication date 6 May 2014

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2053/0.html

zbMATH Keywords

minimal distancenear-ring codeprime

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other types of codes (94B60)

Recommendations

• scientific article; zbMATH DE number 218242
• On the distance distribution of codes
• Linear codes and character sums
• Code distances of some classes of (p,p)-codes
• Double-error-correcting cyclic codes and absolutely irreducible polynomials over \(\text{GF}(2)\)

Cited in

(11)

• On some classes of optimal and near-optimal polynomial codes.
• Minimum distance and the minimum weight codewords of Schubert codes
• On the minimum distance of Castle codes
• Coloring the \(n\)-smooth numbers with \(n\) colors
• Minimum distance functions of graded ideals and Reed-Muller-type codes
• scientific article; zbMATH DE number 218242 (Why is no real title available?)
• Proof of a conjecture of Kløve on permutation codes under the Chebychev distance
• An extremum problem for polynomials and bounds for codes with given distance and diameter
• scientific article; zbMATH DE number 7732145 (Why is no real title available?)
• On a conjecture regarding the symmetric difference of certain sets
• A sumset version of a conjecture of Pilz

This page was built for publication: On the minimal distance of a polynomial code

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