Cyclic distances of idempotent convolutional codes
From MaRDI portal
Recommendations
Cites work
- A construction technique for random-error-correcting convolutional codes
- Computing free distances of idempotent convolutional codes
- Computing separability elements for the sentence-ambient algebra of split ideal codes
- Convolutional codes I: Algebraic structure
- Convolutional codes with a matrix-algebra word-ambient
- Convolutional codes with additional algebraic structure
- Error control coding. Fundamentals and applications
- Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
- Free distance bounds for convolutional codes
- Fundamentals of Error-Correcting Codes
- Group convolutional codes
- scientific article; zbMATH DE number 1314690 (Why is no real title available?)
- Ideal codes over separable ring extensions
- Maximum distance separable convolutional codes
- On behaviors and convolutional codes
- On cyclic convolutional codes
- On the structure of convolutional and cyclic convolutional codes
- Separable automorphisms on matrix algebras over finite field extensions: applications to ideal codes.
- Structure and constructions of cyclic convolutional codes
- The intractability of computing the minimum distance of a code
Cited in
(9)- Roos bound for skew cyclic codes in Hamming and rank metric
- Peterson-Gorenstein-Zierler algorithm for differential convolutional codes
- On doubly-cyclic convolutional codes
- Distance distributions of cyclic orbit codes
- Code decomposition in the analysis of a convolutional code
- Cyclic convolutional codes over separable extensions
- Computing free distances of idempotent convolutional codes
- Convolutional cylinder-type block-circulant cycle codes
- Skew Laurent series and general cyclic convolutional codes
This page was built for publication: Cyclic distances of idempotent convolutional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200297)