A construction technique for random-error-correcting convolutional codes

DOI10.1109/TIT.1969.1054337MaRDI QIDQ5568913zbMATH OpenOpenAlexFDO

Authors Daniel J. jun. Costello

Publication date 1969

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

Full work available at URL https://doi.org/10.1109/tit.1969.1054337

zbMATH Keywords

information, communication

Recommendations

• Some convolutional codes whose free distances are maximal
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• scientific article; zbMATH DE number 5896948
• An algebraic construction of rate<tex>1/v</tex>-ary codes; algebraic construction (Corresp.)
• scientific article; zbMATH DE number 721804

Cited in

(12)

• Probabilistic construction of large constraint length trellis codes for sequential decoding
• Cyclic distances of idempotent convolutional codes
• Finite-state codes
• A fast algorithm for computing distance spectrum of convolutional codes
• Randomness and structure in channel coding
• New constructions of MDP convolutional codes with memory 1 for k=2,3
• Cryptography and Coding
• scientific article; zbMATH DE number 3934930 (Why is no real title available?)
• On the existence and construction of maximum distance profile convolutional codes
• Minimum distance estimates of the performance of sequential decoders
• Some convolutional codes whose free distances are maximal
• On a technique to calculate the exact performance of a convolutional code

This page was built for publication: A construction technique for random-error-correcting convolutional codes

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