Explicit construction of optimal constant-weight codes for identification via channels

DOI10.1109/18.179339zbMATH Open0764.94007OpenAlexW2149869936MaRDI QIDQ4034428FDOQ4034428

Authors Sergio Verdú, Victor K. Wei

Publication date 16 May 1993

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

Full work available at URL https://semanticscholar.org/paper/1d77d3f639ffe245eac4918c730c0a4e95b344cc

zbMATH Keywords

Reed-Solomon codesShannon capacitynoisy channelchannel transmission codeconcatenated constant-weight codeidentification coding theorems

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25) Channel models (including quantum) in information and communication theory (94A40) Other types of codes (94B60)

Recommendations

• New results in the theory of identification via channels
• Identification via channels
• Identification and Other Probabilistic Models
• New converses in the theory of identification via channels
• Strongly universal hashing and identification codes via channels

Cited in

(4)

• Finding $C_{\text{NRI}}({\mathcal W})$ , the Identification Capacity of the AVC ${\mathcal W}$ , if Randomization in the Encoding Is Excluded
• Huge Size Codes for Identification Via a Multiple Access Channel Under a Word-Length Constraint
• Identification and Other Probabilistic Models
• Strongly universal hashing and identification codes via channels

This page was built for publication: Explicit construction of optimal constant-weight codes for identification via channels

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