On viewing block codes as finite automata. (Q1401192)

From MaRDI portal
Revision as of 09:47, 6 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On viewing block codes as finite automata.
scientific article

    Statements

    title
    On viewing block codes as finite automata. (English)
    0 references
    author
    Amitava Dasgupta
    0 references
    Kaustubh Deshmukh
    0 references
    B. Sundar Rajan
    0 references
    Priti Shankar
    0 references
    publication date
    17 August 2003
    0 references
    zbMATH DE Number
    1965233
    0 references
    zbMATH Keywords
    Block codes
    0 references
    Tail-biting trellis
    0 references
    Decoder complexity
    0 references
    Maximum likelihood decoding
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1401192&oldid=34346818"
    Powered by MediaWiki