Nonbinary convolutional coding in channels with jamming

MaRDI QIDQ1814642zbMATH OpenFDO

Authors S. A. Popov, Kamil S. Zigangirov, Vladimir V. Chepyzhov

Publication date 19 August 1998

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

Reed-Solomon codesdecoding algorithmjammingdecoding complexitydiscrete memoryless channeltrellis codes\(J\)-channel\(q\)-ary convolutional codesartificial signal-like noiseexponential-type estimates for the distribution functionupper estimates for the decoding error probability

Mathematics Subject Classification ID

Convolutional codes (94B10) Decoding (94B35)

Recommendations

• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• Two classes of convolutional codes over GF(q) for q-ary orthogonal signaling
• scientific article; zbMATH DE number 721804
• CONVOLUTIONAL CODES FOR PHASE-MODULATED CHANNELS

Cited in

(4)

• Shannon Meets von Neumann: A Minimax Theorem for Channel Coding in the Presence of a Jammer
• Nonuniform Fuchsian codes for noisy channels
• On the user capacity for a multiple-access system in a vector disjunctive channel with errors
• A noncoherent coded modulation for 16QAM

This page was built for publication: Nonbinary convolutional coding in channels with jamming

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