A class of quaternary linear codes improving known minimum distances

DOI10.1007/S10623-014-0021-YzbMath1333.94061OpenAlexW1968869137MaRDI QIDQ256563

Dirk Hachenberger, Martin Steinbach

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) Linear codes (general theory) (94B05) Bounds on codes (94B65) Finite fields (field-theoretic aspects) (12E20)

Uses Software

• SageMath
• Code Tables

Cites Work

• Unnamed Item
• A class of linear codes with good parameters
• A Class of Polynomial Codes
• Symmetric polynomials and some good codes

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