Code volume boundaries in the additive channel

MaRDI QIDQ2939043zbMATH OpenFDO

Authors V. K. Leont'ev, G. L. Movsisyan, Zh. G. Margaryan

Publication date 16 January 2015

zbMATH Keywords

additive channelerror correctionupper and lower bounds

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24)

Recommendations

• An upper bound for codes for the noisy two-access binary adder channel (Corresp.)
• Bounds for codes in the case of list decoding of finite volume
• scientific article; zbMATH DE number 3970683
• Lower bounds to error probability for coding on discrete memoryless channels. I
• Coding for Adder Channels

Cited in

(2)

• Classification of subsets of \(B^n\) and additive channels
• A broad class of additive error coding, channels and lower bound on the probability of error for block codes using SK-metric

This page was built for publication: Code volume boundaries in the additive channel

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