Publication:2718721
From MaRDI portal
zbMath0968.94014MaRDI QIDQ2718721
Publication date: 9 May 2001
decoding algorithm; monomial ordering; Gröbner basis theory; code construction; lower distance bound; multidimensional convolutional codes
94B65: Bounds on codes
94-02: Research exposition (monographs, survey articles) pertaining to information and communication theory
94B35: Decoding
94B10: Convolutional codes
Related Items
Series concatenation of 2D convolutional codes by means of input-state-output representations, A decoding algorithm for 2D convolutional codes over the erasure channel, Composition codes, Decoding of 2D convolutional codes over an erasure channel, A construction of MDS 2D convolutional codes of rate \(1/n\) based on superregular matrices, A minimum distance bound for quasi-\(n\)D-cyclic codes, The discrete multidimensional MPUM, The predictable degree property and minimality in multidimensional convolutional coding, Matrix fraction descriptions in convolutional coding, Serial concatenation of a block code and a 2D convolutional code, Realization of 2D \((2,2)\)-periodic encoders by means of 2D periodic separable Roesser models, Non-catastrophicity in multidimensional convolutional coding, Multidimensional quasi-twisted codes: equivalent characterizations and their relation to multidimensional convolutional codes, Realization of 2D convolutional codes of rate \(\frac{1}{n}\) by separable Roesser models, From 1D Convolutional Codes to 2D Convolutional Codes of Rate 1/n, Burst Erasure Correction of 2D Convolutional Codes
