Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Woven convolutional graph codes with large free distances

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

DOI10.1134/S0032946011010017zbMath1241.94032MaRDI QIDQ764245

F. Hug, Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov

Publication date: 13 March 2012

Published in: Problems of Information Transmission (Search for Journal in Brave)


zbMATH Keywords

convolutional codesViterbi decodingwoven graph codes


Mathematics Subject Classification ID

Bounds on codes (94B65) Decoding (94B35) Convolutional codes (94B10)





Cites Work

  • Unnamed Item
  • Unnamed Item
  • Graph-based convolutional and block LDPC codes
  • A BEAST for Prowling in Trees
  • A recursive approach to low complexity codes
  • Woven convolutional codes .I. Encoder properties
  • Woven Graph Codes: Asymptotic Performances and Examples
  • A Rate $R=5/20$ Hypergraph-Based Woven Convolutional Code With Free Distance $120$




This page was built for publication: Woven convolutional graph codes with large free distances

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:764245&oldid=12694845"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 10:46.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki