On block coded ARQ schemes cumulating the rejected sequences

Toshihiro Niinomi, Toshiyasu Matsushima, Shigeichi Hirasawa

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

    Abstract

    We show that the received sequences, which are rejected and not discarded on ARQ schemes, make the next decision with repeat request powerful by a random coding arguments. We first give the ordinary ARQ of the basic algorithm with some criterion, and define the ARQ with cumulating the rejected sequences, which naturally extended from the ordinary one. Then we study the error exponent of decoding the second received sequences under the condition that the first is rejected. We assume the block coded ARQ with noiseless feedback.

    Original languageEnglish
    Title of host publicationIEEE International Symposium on Information Theory - Proceedings
    Pages376
    Number of pages1
    DOIs
    Publication statusPublished - 1994
    Event1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim
    Duration: 1994 Jun 271994 Jul 1

    Other

    Other1994 IEEE International Symposium on Information Theory, ISIT 1994
    CityTrondheim
    Period94/6/2794/7/1

    Fingerprint

    Decoding
    Feedback
    Error Exponent
    Coding

    ASJC Scopus subject areas

    • Applied Mathematics
    • Modelling and Simulation
    • Theoretical Computer Science
    • Information Systems

    Cite this

    Niinomi, T., Matsushima, T., & Hirasawa, S. (1994). On block coded ARQ schemes cumulating the rejected sequences. In IEEE International Symposium on Information Theory - Proceedings (pp. 376). [394643] https://doi.org/10.1109/ISIT.1994.394643

    On block coded ARQ schemes cumulating the rejected sequences. / Niinomi, Toshihiro; Matsushima, Toshiyasu; Hirasawa, Shigeichi.

    IEEE International Symposium on Information Theory - Proceedings. 1994. p. 376 394643.

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

    Niinomi, T, Matsushima, T & Hirasawa, S 1994, On block coded ARQ schemes cumulating the rejected sequences. in IEEE International Symposium on Information Theory - Proceedings., 394643, pp. 376, 1994 IEEE International Symposium on Information Theory, ISIT 1994, Trondheim, 94/6/27. https://doi.org/10.1109/ISIT.1994.394643
    Niinomi T, Matsushima T, Hirasawa S. On block coded ARQ schemes cumulating the rejected sequences. In IEEE International Symposium on Information Theory - Proceedings. 1994. p. 376. 394643 https://doi.org/10.1109/ISIT.1994.394643
    Niinomi, Toshihiro ; Matsushima, Toshiyasu ; Hirasawa, Shigeichi. / On block coded ARQ schemes cumulating the rejected sequences. IEEE International Symposium on Information Theory - Proceedings. 1994. pp. 376
    @inproceedings{5333a8d76cf34e18a67997e435f022a5,
    title = "On block coded ARQ schemes cumulating the rejected sequences",
    abstract = "We show that the received sequences, which are rejected and not discarded on ARQ schemes, make the next decision with repeat request powerful by a random coding arguments. We first give the ordinary ARQ of the basic algorithm with some criterion, and define the ARQ with cumulating the rejected sequences, which naturally extended from the ordinary one. Then we study the error exponent of decoding the second received sequences under the condition that the first is rejected. We assume the block coded ARQ with noiseless feedback.",
    author = "Toshihiro Niinomi and Toshiyasu Matsushima and Shigeichi Hirasawa",
    year = "1994",
    doi = "10.1109/ISIT.1994.394643",
    language = "English",
    isbn = "0780320158",
    pages = "376",
    booktitle = "IEEE International Symposium on Information Theory - Proceedings",

    }

    TY - GEN

    T1 - On block coded ARQ schemes cumulating the rejected sequences

    AU - Niinomi, Toshihiro

    AU - Matsushima, Toshiyasu

    AU - Hirasawa, Shigeichi

    PY - 1994

    Y1 - 1994

    N2 - We show that the received sequences, which are rejected and not discarded on ARQ schemes, make the next decision with repeat request powerful by a random coding arguments. We first give the ordinary ARQ of the basic algorithm with some criterion, and define the ARQ with cumulating the rejected sequences, which naturally extended from the ordinary one. Then we study the error exponent of decoding the second received sequences under the condition that the first is rejected. We assume the block coded ARQ with noiseless feedback.

    AB - We show that the received sequences, which are rejected and not discarded on ARQ schemes, make the next decision with repeat request powerful by a random coding arguments. We first give the ordinary ARQ of the basic algorithm with some criterion, and define the ARQ with cumulating the rejected sequences, which naturally extended from the ordinary one. Then we study the error exponent of decoding the second received sequences under the condition that the first is rejected. We assume the block coded ARQ with noiseless feedback.

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

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

    U2 - 10.1109/ISIT.1994.394643

    DO - 10.1109/ISIT.1994.394643

    M3 - Conference contribution

    AN - SCOPUS:84894339606

    SN - 0780320158

    SN - 9780780320154

    SP - 376

    BT - IEEE International Symposium on Information Theory - Proceedings

    ER -