Supports of a code

DOI10.1007/3-540-60114-7_1MaRDI QIDQ4352778zbMATH OpenFDO

Authors L. A. Bassalygo

Publication date 15 December 1997

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-60114-7_1

zbMATH Keywords

generalized Hamming distanceslist decodingsupport

Mathematics Subject Classification ID

Bounds on codes (94B65)

Review text

In [\textit{G. Cohen}, \textit{S. Litsyn} and \textit{G. Zemor}, IEEE Trans. Inf. Theory 40, No. 6, 2090-2092 (1994; Zbl 0826.94031)] the notion of generalized Hamming distances (GHD) was introduced for nonlinear codes but the principal result consisted in the proof of an Elias-type bound for these distances. Unfortunately, this definition of GHD does not satisfy the essential property of strict monotonicity of the well-known definition of GHC for linear codes: \(d_1<d_2<d_2<\dots\) The author gives a new definition for arbitrary codes and a new interpretation of GHD, connected with a list decoding for erasure channel. For the entire collection see [Zbl 0847.00060].

Recommendations

• Upper bounds on generalized distances
• scientific article; zbMATH DE number 2123381
• Bounds on generalized weights
• Generalized Hamming weights of linear codes
• Bounds on the minimum support weights

Cited in

(1)

• Upper bounds on generalized distances

This page was built for publication: Supports of a code

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