Limit distribution of the minimum distance of random linear codes

DOI10.1109/TIT.1967.1054053MaRDI QIDQ5564908zbMATH OpenFDO

Authors John N. Pierce

Publication date 1967

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

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

zbMATH Keywords

information, communication

Cited in

(13)

• Algebraic theory of block codes detecting independent errors
• New approaches to reduced-complexity decoding
• Self-orthogonal quasi-abelian codes are asymptotically good
• Density of free modules over finite chain rings
• A code-based signature scheme from the Lyubashevsky framework
• Asymptotic behaviour of codes in rank metric over finite fields
• Optimal Narain CFTs from codes
• A zero-knowledge identification scheme based on the q-ary syndrome decoding problem
• A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
• Hermitian self-dual 2-quasi-abelian codes
• Correlated pseudorandomness from the hardness of quasi-abelian decoding
• Asymptotically good LCD 2-quasi-abelian codes over finite fields
• Information set decoding for ring-linear codes

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

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