Limit distribution of the minimum distance of random linear codes

DOI10.1109/TIT.1967.1054053zbMath0178.22404MaRDI QIDQ5564908

John N. Pierce

Publication date: 1967

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

zbMATH Keywords

information, communication

Related Items (11)

Density of free modules over finite chain rings ⋮ Algebraic theory of block codes detecting independent errors ⋮ A code-based signature scheme from the Lyubashevsky framework ⋮ Hermitian self-dual 2-quasi-abelian codes ⋮ Optimal Narain CFTs from codes ⋮ Correlated pseudorandomness from the hardness of quasi-abelian decoding ⋮ Asymptotic behaviour of codes in rank metric over finite fields ⋮ A New Efficient Threshold Ring Signature Scheme Based on Coding Theory ⋮ New approaches to reduced-complexity decoding ⋮ A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem ⋮ Self-orthogonal quasi-abelian codes are asymptotically good

This page was built for publication: Limit distribution of the minimum distance of random linear codes