Woven convolutional graph codes with large free distances

DOI10.1134/S0032946011010017zbMATH Open1241.94032MaRDI QIDQ764245FDOQ764245

Authors: 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)

Recommendations

• Woven convolutional codes .I. Encoder properties
• scientific article; zbMATH DE number 2154124
• Asymptotic distance properties of binary woven convolutional codes
• scientific article; zbMATH DE number 2154121
• Woven Convolutional Codes II: Decoding Aspects

zbMATH Keywords

convolutional codesViterbi decodingwoven graph codes

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Woven Convolutional Codes II: Decoding Aspects
• Title not available (Why is that?)
• Asymptotic distance properties of binary woven convolutional codes
• On the performance of block woven codes constructions with row-wise permutations
• Title not available (Why is that?)
• Woven convolutional codes .I. Encoder properties
• On the error exponent for woven convolutional codes with inner warp

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

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