Asymptotically good convolutional codes
From MaRDI portal
Abstract: In this paper, we construct new sequences of asymptotically good convolutional codes. These sequences are obtained from sequences of transitive, self-orthogonal and self-dual block codes that attain the Tsfasman-Vladut-Zink bound. Furthermore, by applying the techniques of expanding, extending, puncturing, direct sum, the |u|u+v| construction and the product code construction to these block codes, we construct more new sequences of asymptotically good convolutional codes. Additionally, we show that the proposed construction method presented here also works when applied for all sequences of good block codes where lim kj/nj and lim dj/nj exist.
Recommendations
Cites work
- scientific article; zbMATH DE number 3771502 (Why is no real title available?)
- scientific article; zbMATH DE number 3458474 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1314690 (Why is no real title available?)
- scientific article; zbMATH DE number 3440295 (Why is no real title available?)
- A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
- Algebraic Function Fields and Codes
- Constructions of MDS-convolutional codes
- Convolutional codes I: Algebraic structure
- Convolutional codes with maximum distance profile
- Convolutional codes. An algebraic approach
- Distance Bounds for an Ensemble of LDPC Convolutional Codes
- Fundamentals of Error-Correcting Codes
- Generalized AG convolutional codes
- Improved construction of LDPC convolutional codes with semi-random parity-check matrices
- Maximum distance separable convolutional codes
- Minimum Distance and Trapping Set Analysis of Protograph-Based LDPC Convolutional Codes
- New convolutional code constructions and a class of asymptotically good time-varying codes
- On Classical and Quantum MDS-Convolutional BCH Codes
- On MDS convolutional codes over \(\mathbb{Z}_{p^r}\)
- On Minimality of Convolutional Ring Encoders
- On negacyclic MDS-convolutional codes
- On optimal constacyclic codes
- On the asymptotic behaviour of some towers of function fields over finite fields
- Searching for Binary and Nonbinary Block and Convolutional LDPC Codes
- Spatially Coupled LDPC Codes Constructed From Protographs
- Strongly-MDS convolutional codes
- Time-varying periodic convolutional codes with low-density parity-check matrix
- Transitive and self-dual codes attaining the Tsfasman-Vla/spl breve/dut$80-Zink bound
- Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes
Cited in
(5)- Generalized AG convolutional codes
- Asymptotically good codes have infinite trellis complexity
- Realization of 2D (2,2)-periodic encoders by means of 2D periodic separable Roesser models
- A search for good convolutional codes to be used in the construction of turbo codes
- Convolutional codes: techniques of construction
This page was built for publication: Asymptotically good convolutional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5378516)
