A class of quaternary linear codes improving known minimum distances

DOI10.1007/S10623-014-0021-YMaRDI QIDQ256563zbMATH OpenOpenAlexFDO

Authors Martin Steinbach, Dirk Hachenberger

Publication date 9 March 2016

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-014-0021-y

zbMATH Keywords

codes by evaluationfinite field polynomial mappingsgeneralization of Reed-Solomon codesquaternary code

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Finite fields (field-theoretic aspects) (12E20) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Recommendations

• scientific article; zbMATH DE number 7180107
• New quasi-twisted quaternary linear codes
• scientific article; zbMATH DE number 2233290
• New minimum distance bounds for linear codes over small fields
• Some new quasi-twisted ternary linear codes

Cites work

• scientific article; zbMATH DE number 967590 (Why is no real title available?)
• A Class of Polynomial Codes
• A class of linear codes with good parameters
• Symmetric polynomials and some good codes

Cited in

(6)

• Some lengths for which CPP interleavers have weaker minimum distances than QPP interleavers
• Quasiperfect linear binary codes with distance 4 and complete caps in projective geometry
• Improved estimates via exponential sums for the minimum distance of Z/sub 4/-linear trace codes
• On the \(l\)-extendability of quaternary linear codes
• Quasi-Perfect Codes With Small Distance
• Optimal Additive Quaternary Codes of Low Dimension

Describes a project that uses

Uses Software

• Code Tables
• SageMath

This page was built for publication: A class of quaternary linear codes improving known minimum distances

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