On block coded ARQ schemes cumulating the rejected sequences

Toshihiro Niinomi; Toshiyasu Matsushima; Shigeichi Hirasawa

doi:10.1109/ISIT.1994.394643

On block coded ARQ schemes cumulating the rejected sequences

Toshihiro Niinomi, Toshiyasu Matsushima, Shigeichi Hirasawa

School of Fundamental Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
Number of pages	1
DOIs	https://doi.org/10.1109/ISIT.1994.394643
Publication status	Published - 1994 Dec 1
Event	1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway Duration: 1994 Jun 27 → 1994 Jul 1

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Conference

Conference	1994 IEEE International Symposium on Information Theory, ISIT 1994
Country/Territory	Norway
City	Trondheim
Period	94/6/27 → 94/7/1

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.1994.394643

Cite this

On block coded ARQ schemes cumulating the rejected sequences. / Niinomi, Toshihiro; Matsushima, Toshiyasu; Hirasawa, Shigeichi.
Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994. 1994. 394643 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Niinomi, T, Matsushima, T & Hirasawa, S 1994, On block coded ARQ schemes cumulating the rejected sequences. in Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994., 394643, IEEE International Symposium on Information Theory - Proceedings, 1994 IEEE International Symposium on Information Theory, ISIT 1994, Trondheim, Norway, 94/6/27. https://doi.org/10.1109/ISIT.1994.394643

@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",

month = dec,

day = "1",

doi = "10.1109/ISIT.1994.394643",

language = "English",

isbn = "0780320158",

series = "IEEE International Symposium on Information Theory - Proceedings",

booktitle = "Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994",

note = "1994 IEEE International Symposium on Information Theory, ISIT 1994 ; Conference date: 27-06-1994 Through 01-07-1994",

}

TY - GEN

T1 - On block coded ARQ schemes cumulating the rejected sequences

AU - Niinomi, Toshihiro

AU - Matsushima, Toshiyasu

AU - Hirasawa, Shigeichi

PY - 1994/12/1

Y1 - 1994/12/1

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

T3 - IEEE International Symposium on Information Theory - Proceedings

BT - Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994

T2 - 1994 IEEE International Symposium on Information Theory, ISIT 1994

Y2 - 27 June 1994 through 1 July 1994

ER -

On block coded ARQ schemes cumulating the rejected sequences

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this