Bounds on the error probability of finite-length RaptorQ codes

Ke Zhang; Jian Jiao; Zixuan Huang; Shaohua Wu; Shushi Gu; Qinyu Zhang

doi:10.1109/ICCChina.2017.8330415

Bounds on the error probability of finite-length RaptorQ codes

Ke Zhang
, Jian Jiao
, Zixuan Huang
, Shaohua Wu
, Shushi Gu
, Qinyu Zhang

Harbin Institute of Technology Shenzhen

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

1 Scopus citations

Abstract

Massive machine-To-machine (mM2M) communication requires data transmission in short packets, but at present, the theory of short length code design and optimazation is still incompletely. In this paper, we analyze the maximum likelihood (ML) decoding failure probability (DFP) of finite length RaptorQ codes, and propose a theoretical performance bound of DFP on the RaptorQ codes under ML decoding algorithm by investigating the rank of the product of two random coefficient matrices. Moreover, we verify the accuracy of derived theoretical bounds through the Monte Carlo simulations over varied Galois field order. The high accuracy bounds can be used to design near-optimum RaptorQ codes with short and moderate lengths.

Original language	English
Title of host publication	2017 IEEE/CIC International Conference on Communications in China, ICCC 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1-6
Number of pages	6
ISBN (Electronic)	9781538645024
DOIs	https://doi.org/10.1109/ICCChina.2017.8330415
State	Published - 2 Jul 2017
Externally published	Yes
Event	2017 IEEE/CIC International Conference on Communications in China, ICCC 2017 - Qingdao, China Duration: 22 Oct 2017 → 24 Oct 2017

Publication series

Name	2017 IEEE/CIC International Conference on Communications in China, ICCC 2017
Volume	2018-January

Conference

Conference	2017 IEEE/CIC International Conference on Communications in China, ICCC 2017
Country/Territory	China
City	Qingdao
Period	22/10/17 → 24/10/17

Keywords

finite length RaptorQ codes
mM2M communication
maximum likelihood decoding
theoretical bounds

Access to Document

10.1109/ICCChina.2017.8330415

Cite this

Zhang, K., Jiao, J., Huang, Z., Wu, S., Gu, S., & Zhang, Q. (2017). Bounds on the error probability of finite-length RaptorQ codes. In 2017 IEEE/CIC International Conference on Communications in China, ICCC 2017 (pp. 1-6). (2017 IEEE/CIC International Conference on Communications in China, ICCC 2017; Vol. 2018-January). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCChina.2017.8330415

@inproceedings{258065409949465d9373515adfe6e60a,

title = "Bounds on the error probability of finite-length RaptorQ codes",

abstract = "Massive machine-To-machine (mM2M) communication requires data transmission in short packets, but at present, the theory of short length code design and optimazation is still incompletely. In this paper, we analyze the maximum likelihood (ML) decoding failure probability (DFP) of finite length RaptorQ codes, and propose a theoretical performance bound of DFP on the RaptorQ codes under ML decoding algorithm by investigating the rank of the product of two random coefficient matrices. Moreover, we verify the accuracy of derived theoretical bounds through the Monte Carlo simulations over varied Galois field order. The high accuracy bounds can be used to design near-optimum RaptorQ codes with short and moderate lengths.",

keywords = "finite length RaptorQ codes, mM2M communication, maximum likelihood decoding, theoretical bounds",

author = "Ke Zhang and Jian Jiao and Zixuan Huang and Shaohua Wu and Shushi Gu and Qinyu Zhang",

note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE/CIC International Conference on Communications in China, ICCC 2017 ; Conference date: 22-10-2017 Through 24-10-2017",

year = "2017",

month = jul,

day = "2",

doi = "10.1109/ICCChina.2017.8330415",

language = "英语",

series = "2017 IEEE/CIC International Conference on Communications in China, ICCC 2017",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1--6",

booktitle = "2017 IEEE/CIC International Conference on Communications in China, ICCC 2017",

address = "美国",

}

Zhang, K, Jiao, J, Huang, Z, Wu, S , Gu, S & Zhang, Q 2017, Bounds on the error probability of finite-length RaptorQ codes. in 2017 IEEE/CIC International Conference on Communications in China, ICCC 2017. 2017 IEEE/CIC International Conference on Communications in China, ICCC 2017, vol. 2018-January, Institute of Electrical and Electronics Engineers Inc., pp. 1-6, 2017 IEEE/CIC International Conference on Communications in China, ICCC 2017, Qingdao, China, 22/10/17. https://doi.org/10.1109/ICCChina.2017.8330415

Bounds on the error probability of finite-length RaptorQ codes. / Zhang, Ke; Jiao, Jian; Huang, Zixuan et al.
2017 IEEE/CIC International Conference on Communications in China, ICCC 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 1-6 (2017 IEEE/CIC International Conference on Communications in China, ICCC 2017; Vol. 2018-January).

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

TY - GEN

T1 - Bounds on the error probability of finite-length RaptorQ codes

AU - Zhang, Ke

AU - Jiao, Jian

AU - Huang, Zixuan

AU - Wu, Shaohua

AU - Gu, Shushi

AU - Zhang, Qinyu

PY - 2017/7/2

Y1 - 2017/7/2

N2 - Massive machine-To-machine (mM2M) communication requires data transmission in short packets, but at present, the theory of short length code design and optimazation is still incompletely. In this paper, we analyze the maximum likelihood (ML) decoding failure probability (DFP) of finite length RaptorQ codes, and propose a theoretical performance bound of DFP on the RaptorQ codes under ML decoding algorithm by investigating the rank of the product of two random coefficient matrices. Moreover, we verify the accuracy of derived theoretical bounds through the Monte Carlo simulations over varied Galois field order. The high accuracy bounds can be used to design near-optimum RaptorQ codes with short and moderate lengths.

AB - Massive machine-To-machine (mM2M) communication requires data transmission in short packets, but at present, the theory of short length code design and optimazation is still incompletely. In this paper, we analyze the maximum likelihood (ML) decoding failure probability (DFP) of finite length RaptorQ codes, and propose a theoretical performance bound of DFP on the RaptorQ codes under ML decoding algorithm by investigating the rank of the product of two random coefficient matrices. Moreover, we verify the accuracy of derived theoretical bounds through the Monte Carlo simulations over varied Galois field order. The high accuracy bounds can be used to design near-optimum RaptorQ codes with short and moderate lengths.

KW - finite length RaptorQ codes

KW - mM2M communication

KW - maximum likelihood decoding

KW - theoretical bounds

UR - https://www.scopus.com/pages/publications/85049686457

U2 - 10.1109/ICCChina.2017.8330415

DO - 10.1109/ICCChina.2017.8330415

M3 - 会议稿件

AN - SCOPUS:85049686457

T3 - 2017 IEEE/CIC International Conference on Communications in China, ICCC 2017

SP - 1

EP - 6

BT - 2017 IEEE/CIC International Conference on Communications in China, ICCC 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2017 IEEE/CIC International Conference on Communications in China, ICCC 2017

Y2 - 22 October 2017 through 24 October 2017

ER -

Zhang K, Jiao J, Huang Z, Wu S , Gu S , Zhang Q. Bounds on the error probability of finite-length RaptorQ codes. In 2017 IEEE/CIC International Conference on Communications in China, ICCC 2017. Institute of Electrical and Electronics Engineers Inc. 2017. p. 1-6. (2017 IEEE/CIC International Conference on Communications in China, ICCC 2017). doi: 10.1109/ICCChina.2017.8330415

Bounds on the error probability of finite-length RaptorQ codes

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this