Minimal Trellis Construction for Finite Support Convolutional Ring Codes (Q3540925): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Modular and \(p\)-adic cyclic codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix fraction descriptions in convolutional coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dynamics of group codes: state spaces, trellis diagrams, and canonical encoders / rank
 
Normal rank
Property / cites work
 
Property / cites work: State space realizations and monomial equivalence for convolutional codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3902876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The predictable degree property and row reducedness for systems over a finite ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimality of Convolutional Ring Encoders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimality and observability of group systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convolutional codes over groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the weight distribution of CRC codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic codes and quadratic residue codes over Z/sub 4/ / rank
 
Normal rank
Property / cites work
 
Property / cites work: On behaviors and convolutional codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum distance separable convolutional codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quaternary Convolutional Codes From Linear Block Codes Over Galois Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for constructing minimal trellises for codes over finite abelian groups / rank
 
Normal rank

Latest revision as of 20:03, 28 June 2024

scientific article
Language Label Description Also known as
English
Minimal Trellis Construction for Finite Support Convolutional Ring Codes
scientific article

    Statements

    Minimal Trellis Construction for Finite Support Convolutional Ring Codes (English)
    0 references
    0 references
    0 references
    25 November 2008
    0 references
    polynomial module
    0 references
    finite ring
    0 references
    row reduced
    0 references
    \(p\)-generator sequence
    0 references
    convolutional code
    0 references
    minimal trellis
    0 references

    Identifiers