Classification of binary systematic codes of small defect

MaRDI QIDQ5265496zbMATH OpenFDO

Authors Alberto Ravagnani

Publication date 28 July 2015

Full work available at URL https://arxiv.org/abs/1209.1716, http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/1031

zbMATH Keywords

binary codenonlinear codeAMDS codesystematic codealmost maximum distance separable (AMDS) code

Mathematics Subject Classification ID

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

Abstract: In this paper non-trivial non-linear binary systematic AMDS codes are classified in terms of their weight distributions, employing only elementary techniques. In particular, we show that their length and minimum distance completely determine the weight distribution.

Recommendations

• An upper bound on the weight distribution of some systematic codes (Corresp.)
• A formula on the weight distribution of linear codes with applications to AMDS codes
• On a criterion for perfect binary codes to be nonsystematic.
• scientific article; zbMATH DE number 1188976
• Notes on generalized Hamming weights of some classes of binary codes

Cited in

(2)

• scientific article; zbMATH DE number 2170443 (Why is no real title available?)
• An upper bound on the weight distribution of some systematic codes (Corresp.)

This page was built for publication: Classification of binary systematic codes of small defect

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