Code construction for the noiseless binary switching multiple-access channel

DOI10.1109/18.21242MaRDI QIDQ3818236zbMATH OpenOpenAlexFDO

Authors Peter Vanroose

Publication date 1989

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

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

zbMATH Keywords

convolutional codesUpper and lower boundszero-error capacitybinary adder channeldiscrete memoryless multiple-access channelnoiseless coding problem

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Convolutional codes (94B10)

Recommendations

• Coding for a multiple-access channel
• Further results on coding for T-user multiple-access channels (Corresp.)
• A family of good uniquely decodable code pairs for the two-access binary adder channel
• An upper bound for codes for the noisy two-access binary adder channel (Corresp.)
• scientific article; zbMATH DE number 493103

Cited in

(5)

• Matrix characterization of linear codes with arbitrary Hamming weight hierarchy
• Coding for a multiple-access channel
• Further results on coding for T-user multiple-access channels (Corresp.)
• New rate pairs in the zero-error capacity region of the binary multiplying channel without feedback
• scientific article; zbMATH DE number 4031571 (Why is no real title available?)

This page was built for publication: Code construction for the noiseless binary switching multiple-access channel

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