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

Some optimal partial-unit-memory codes (Corresp.)

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

DOI10.1109/TIT.1979.1056014zbMATH Open0393.94020MaRDI QIDQ4175166FDOQ4175166

Gregory S. Lauer

Publication date: 1979

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




zbMATH Keywords

Binary Convolutional CodesMaximum Free DistanceOptimal Partial-Unit-Memory Codes


Mathematics Subject Classification ID

Convolutional codes (94B10)



Cited In (4)

  • The number of convolutional codes of span one
  • On (partial) unit memory codes based on Gabidulin codes
  • On Optimal Extended Row Distance Profile
  • Concatenated codes with convolutional inner and outer codes






This page was built for publication: Some optimal partial-unit-memory codes (Corresp.)

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

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