The asymptotic average degree of an augmented polynomial

DOI10.1016/S0019-9958(68)90145-9MaRDI QIDQ5546462zbMATH OpenOpenAlexFDO

Authors E. K. Bower, Daniel D. Sullivan, S. J. Dwyer III

Publication date 1968

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(68)90145-9

zbMATH Keywords

information, communication

Recommendations

• On classes of convolutional codes that are not asymptotically catastrophic
• Asymptotically catastrophic convolutional codes
• Polynomial weights and code constructions
• Tight bounds on the minimum average weight per branch for rate (N-1)/N convolutional codes
• Polynomial-time construction of codes. I: Linear codes with almost equal weights

This page was built for publication: The asymptotic average degree of an augmented polynomial

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