Improved error exponent for time-invariant and periodically time-variant convolutional codes

DOI10.1109/18.817511MaRDI QIDQ4503520zbMATH OpenOpenAlexFDO

Authors Nadav Shulman, Meir Feder

Publication date 7 September 2000

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

Full work available at URL https://semanticscholar.org/paper/0fef2980a902403bafefc3a699f00ab81a33196c

zbMATH Keywords

error exponenterror probabilityfirst error eventperiodically time-variant codestime-invariant convolutional codesYudkin-Viterbi exponent

Mathematics Subject Classification ID

Convolutional codes (94B10) Error probability in coding theory (94B70)

Recommendations

• Time-varying periodic convolutional codes with low-density parity-check matrix
• Tighter bounds on the error probability of fixed convolutional codes
• A systems theory approach to periodically time-varying convolutional codes by means of their invariant equivalent
• Construction of time-invariant LDPC convolutional codes with modified method
• Distance Bounds for Periodically Time-Varying and Tail-Biting LDPC Convolutional Codes
• On the error exponent of convolutionally coded ARQ
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• Error exponents for product convolutional codes
• Some periodic convolutional codes better than any fixed code (Corresp.)
• New upper bounds for decoding error probability for convolutional codes

This page was built for publication: Improved error exponent for time-invariant and periodically time-variant convolutional codes

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