A comparison of known codes, random codes, and the best codes

DOI10.1109/18.737529zbMath0953.94038OpenAlexW2152173278MaRDI QIDQ4701225

Samuel J. MacMullan, Oliver Michael Collins

Publication date: 21 November 1999

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

Full work available at URL: https://semanticscholar.org/paper/532ab938e83cc898318aebe970919af187fc3166

zbMATH Keywords

sphere-packing boundsingleton boundrandom codeserror-probability bounds

Mathematics Subject Classification ID

Bounds on codes (94B65) Error probability in coding theory (94B70)

Related Items (2)

New asymptotic representations of the noncentral t‐distribution ⋮ LDPC codes from Singer cycles

This page was built for publication: A comparison of known codes, random codes, and the best codes