scientific article; zbMATH DE number 4031571

MaRDI QIDQ3772128zbMATH OpenFDO

Authors G. Kh. Khachatrian, Samvel S. Martirossian

Publication date 1987

zbMATH Keywords

noiseless adder channelquasibasic codes for T-user noiseless channels

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Code construction for the T-user noiseless adder channel
• Coding for the Multiple-Access Adder Channel
• A multiuser k-ary code for the noisy multiple-access adder channel
• Coding for Adder Channels
• Signature codes for noisy multiple access adder channel
• Code construction for the noiseless binary switching multiple-access channel
• An upper bound for codes for the noisy two-access binary adder channel (Corresp.)
• Coding and capacity calculation for the \(\mathcal{T}\)-user \(F\)-adder channel
• Nearly optimal multiuser codes for the binary adder channel
• scientific article; zbMATH DE number 721901

Cited in

(1)

• Signature codes for noisy multiple access adder channel

This page was built for publication:

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