Converging ARQ schemes

B. Arazi; J. Hsieh

doi:10.1049/ip-f-1.1985.0015

Converging ARQ schemes

Research output: Contribution to journal › Article › peer-review

Abstract

The parity check matrix of an (n, k, t) Hnear error-correcting code provides a unique mapping between binary vectors of length n, whose Hamming weight does not exceed t, and binary vectors of length (n ’ k), which are the syndrome obtained by multiplying the vector of length n by the parity check matrix. This enables the ‘compression’ of binary vectors having a limited Hamming weight. It is shown in the paper how this principle can be applied in ARQ schemes, where, upon detection of an error in a received message, further retransmitted messages can be made shorter from one retransmission to the next.

Original language	English
Pages (from-to)	84-89
Number of pages	6
Journal	IEE Proceedings, Part F: Communications, Radar and Signal Processing
Volume	132
Issue number	2
DOIs	https://doi.org/10.1049/ip-f-1.1985.0015
State	Published - 1 Jan 1985
Externally published	Yes

Keywords

Codes and decoding

ASJC Scopus subject areas

Signal Processing
General Engineering

Access to Document

10.1049/ip-f-1.1985.0015

Cite this

@article{1b7be7bce6cf460bba925cfcbdfddc69,

title = "Converging ARQ schemes",

abstract = "The parity check matrix of an (n, k, t) Hnear error-correcting code provides a unique mapping between binary vectors of length n, whose Hamming weight does not exceed t, and binary vectors of length (n {\textquoteright} k), which are the syndrome obtained by multiplying the vector of length n by the parity check matrix. This enables the {\textquoteleft}compression{\textquoteright} of binary vectors having a limited Hamming weight. It is shown in the paper how this principle can be applied in ARQ schemes, where, upon detection of an error in a received message, further retransmitted messages can be made shorter from one retransmission to the next.",

keywords = "Codes and decoding",

author = "B. Arazi and J. Hsieh",

year = "1985",

month = jan,

day = "1",

doi = "10.1049/ip-f-1.1985.0015",

language = "English",

volume = "132",

pages = "84--89",

journal = "IEE Proceedings, Part F: Communications, Radar and Signal Processing",

issn = "0143-7070",

publisher = "Institute of Electrical Engineers",

number = "2",

}

TY - JOUR

T1 - Converging ARQ schemes

AU - Arazi, B.

AU - Hsieh, J.

PY - 1985/1/1

Y1 - 1985/1/1

N2 - The parity check matrix of an (n, k, t) Hnear error-correcting code provides a unique mapping between binary vectors of length n, whose Hamming weight does not exceed t, and binary vectors of length (n ’ k), which are the syndrome obtained by multiplying the vector of length n by the parity check matrix. This enables the ‘compression’ of binary vectors having a limited Hamming weight. It is shown in the paper how this principle can be applied in ARQ schemes, where, upon detection of an error in a received message, further retransmitted messages can be made shorter from one retransmission to the next.

AB - The parity check matrix of an (n, k, t) Hnear error-correcting code provides a unique mapping between binary vectors of length n, whose Hamming weight does not exceed t, and binary vectors of length (n ’ k), which are the syndrome obtained by multiplying the vector of length n by the parity check matrix. This enables the ‘compression’ of binary vectors having a limited Hamming weight. It is shown in the paper how this principle can be applied in ARQ schemes, where, upon detection of an error in a received message, further retransmitted messages can be made shorter from one retransmission to the next.

KW - Codes and decoding

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

U2 - 10.1049/ip-f-1.1985.0015

DO - 10.1049/ip-f-1.1985.0015

M3 - Article

AN - SCOPUS:0022045961

SN - 0143-7070

VL - 132

SP - 84

EP - 89

JO - IEE Proceedings, Part F: Communications, Radar and Signal Processing

JF - IEE Proceedings, Part F: Communications, Radar and Signal Processing

IS - 2

ER -

Converging ARQ schemes

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this