On analysis of noiseless decision feedback scheme using fixed size list decoder for tree codes

T. Niinomi, Toshiyasu Matsushima, S. Hirasawa

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    The generalized proof is shown for the coding theorem of a decision feedback scheme using list decoding for tree code. DMC characterized by P = {P ij, j ∈ A, i ∈ B} and noiseless feedback is assumed. The exponents obtained has similar properties to those of the Generalized Viterbi Algorithm (GVA).

    Original languageEnglish
    Title of host publicationIEEE International Symposium on Information Theory - Proceedings
    Pages231
    Number of pages1
    Publication statusPublished - 2000
    Event2000 IEEE International Symposium on Information Theory - Serrento, Italy
    Duration: 2000 Jun 252000 Jun 30

    Other

    Other2000 IEEE International Symposium on Information Theory
    CountryItaly
    CitySerrento
    Period00/6/2500/6/30

    Fingerprint

    Feedback
    Viterbi algorithm
    Decoding

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering

    Cite this

    Niinomi, T., Matsushima, T., & Hirasawa, S. (2000). On analysis of noiseless decision feedback scheme using fixed size list decoder for tree codes. In IEEE International Symposium on Information Theory - Proceedings (pp. 231)

    On analysis of noiseless decision feedback scheme using fixed size list decoder for tree codes. / Niinomi, T.; Matsushima, Toshiyasu; Hirasawa, S.

    IEEE International Symposium on Information Theory - Proceedings. 2000. p. 231.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Niinomi, T, Matsushima, T & Hirasawa, S 2000, On analysis of noiseless decision feedback scheme using fixed size list decoder for tree codes. in IEEE International Symposium on Information Theory - Proceedings. pp. 231, 2000 IEEE International Symposium on Information Theory, Serrento, Italy, 00/6/25.
    Niinomi T, Matsushima T, Hirasawa S. On analysis of noiseless decision feedback scheme using fixed size list decoder for tree codes. In IEEE International Symposium on Information Theory - Proceedings. 2000. p. 231
    Niinomi, T. ; Matsushima, Toshiyasu ; Hirasawa, S. / On analysis of noiseless decision feedback scheme using fixed size list decoder for tree codes. IEEE International Symposium on Information Theory - Proceedings. 2000. pp. 231
    @inproceedings{ba44d4de654445d1a91c91c51ece02b7,
    title = "On analysis of noiseless decision feedback scheme using fixed size list decoder for tree codes",
    abstract = "The generalized proof is shown for the coding theorem of a decision feedback scheme using list decoding for tree code. DMC characterized by P = {P ij, j ∈ A, i ∈ B} and noiseless feedback is assumed. The exponents obtained has similar properties to those of the Generalized Viterbi Algorithm (GVA).",
    author = "T. Niinomi and Toshiyasu Matsushima and S. Hirasawa",
    year = "2000",
    language = "English",
    pages = "231",
    booktitle = "IEEE International Symposium on Information Theory - Proceedings",

    }

    TY - GEN

    T1 - On analysis of noiseless decision feedback scheme using fixed size list decoder for tree codes

    AU - Niinomi, T.

    AU - Matsushima, Toshiyasu

    AU - Hirasawa, S.

    PY - 2000

    Y1 - 2000

    N2 - The generalized proof is shown for the coding theorem of a decision feedback scheme using list decoding for tree code. DMC characterized by P = {P ij, j ∈ A, i ∈ B} and noiseless feedback is assumed. The exponents obtained has similar properties to those of the Generalized Viterbi Algorithm (GVA).

    AB - The generalized proof is shown for the coding theorem of a decision feedback scheme using list decoding for tree code. DMC characterized by P = {P ij, j ∈ A, i ∈ B} and noiseless feedback is assumed. The exponents obtained has similar properties to those of the Generalized Viterbi Algorithm (GVA).

    UR - http://www.scopus.com/inward/record.url?scp=0034446913&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0034446913&partnerID=8YFLogxK

    M3 - Conference contribution

    AN - SCOPUS:0034446913

    SP - 231

    BT - IEEE International Symposium on Information Theory - Proceedings

    ER -