Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Short unit-memory byte-oriented binary convolutional codes having maximal free distance (Corresp.)

From MaRDI portal
Publication:4101724
Jump to:navigation, search

DOI10.1109/TIT.1976.1055557zbMATH Open0334.94003OpenAlexW1990919719MaRDI QIDQ4101724FDOQ4101724


Authors: Lin-Nan Lee Edit this on Wikidata


Publication date: 1976

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

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





Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)



Cited In (7)

  • Nonbinary convolutional codes derived from group character codes
  • On optimal extended row distance profile
  • A class of new group character codes and convolutional codes
  • On negacyclic MDS-convolutional codes
  • The number of convolutional codes of span one
  • On cyclotomic cosets and code constructions
  • On optimal constacyclic codes





This page was built for publication: Short unit-memory byte-oriented binary convolutional codes having maximal free distance (Corresp.)

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4101724&oldid=17868692"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 07:04. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki