The worst case probability of undetected error for linear codes on the local binomial channel

DOI10.1109/18.481787zbMath0851.94030OpenAlexW2130798072MaRDI QIDQ4879999

Torleiv Kløve

Publication date: 24 November 1996

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.481787

zbMATH Keywords

linear codeerror detectionundetected errorlocal binomial channelworst case probability

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Error probability in coding theory (94B70)

Related Items (4)

Finite projective geometries and classification of the weight hierarchies of codes. I ⋮ Code constructions and existence bounds for relative generalized Hamming weight ⋮ The weight hierarchies of \(q\)-ary linear codes of dimension 4 ⋮ Weight hierarchies of linear codes of dimension 3

This page was built for publication: The worst case probability of undetected error for linear codes on the local binomial channel