Code construction for the noiseless binary switching multiple-access channel

DOI10.1109/18.21242zbMath0665.94009OpenAlexW2041541028MaRDI QIDQ3818236

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)

Related Items (1)

Matrix characterization of linear codes with arbitrary Hamming weight hierarchy

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