Combination network coding: Alphabet size and zigzag decoding

Chi Wan Sung; Xueqing Gong

Combination network coding: Alphabet size and zigzag decoding

Department of Electrical Engineering

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

11 Citations (Scopus)

Abstract

Combination network coding can be regarded as a generalization of Maximum Distance Separable (MDS) code. An existing bound on the required alphabet size for MDS code is generalized for combination network coding. Besides, a class of combination network code called Zigzag-Decodable (ZD) code is considered. It involves only exclusive-OR and bit-shifting operations and can be decoded by a fast algorithm called zigzag decoding. It was proved that the ZD code has lower encoding and decoding complexities than other existing codes, at the expense of slight rate loss.

Original language	English
Title of host publication	Proceedings of 2014 International Symposium on Information Theory and Its Applications, ISITA 2014
Publisher	IEEE
Pages	699-703
ISBN (Print)	9784885522925
Publication status	Published - 8 Dec 2014
Event	2014 International Symposium on Information Theory and Its Applications, ISITA 2014 - Melbourne, Australia Duration: 26 Oct 2014 → 29 Oct 2014

Conference

Conference	2014 International Symposium on Information Theory and Its Applications, ISITA 2014
Place	Australia
City	Melbourne
Period	26/10/14 → 29/10/14

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{3ba098ea915d4b1fb067f1728a563bfc,

title = "Combination network coding: Alphabet size and zigzag decoding",

abstract = "Combination network coding can be regarded as a generalization of Maximum Distance Separable (MDS) code. An existing bound on the required alphabet size for MDS code is generalized for combination network coding. Besides, a class of combination network code called Zigzag-Decodable (ZD) code is considered. It involves only exclusive-OR and bit-shifting operations and can be decoded by a fast algorithm called zigzag decoding. It was proved that the ZD code has lower encoding and decoding complexities than other existing codes, at the expense of slight rate loss.",

author = "Sung, \{Chi Wan\} and Xueqing Gong",

year = "2014",

month = dec,

day = "8",

language = "English",

isbn = "9784885522925",

pages = "699--703",

booktitle = "Proceedings of 2014 International Symposium on Information Theory and Its Applications, ISITA 2014",

publisher = "IEEE",

address = "United States",

note = "2014 International Symposium on Information Theory and Its Applications, ISITA 2014 ; Conference date: 26-10-2014 Through 29-10-2014",

}

Combination network coding: Alphabet size and zigzag decoding. / Sung, Chi Wan ; Gong, Xueqing.
Proceedings of 2014 International Symposium on Information Theory and Its Applications, ISITA 2014. IEEE, 2014. p. 699-703 6979934.

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Combination network coding

T2 - 2014 International Symposium on Information Theory and Its Applications, ISITA 2014

AU - Sung, Chi Wan

AU - Gong, Xueqing

PY - 2014/12/8

Y1 - 2014/12/8

N2 - Combination network coding can be regarded as a generalization of Maximum Distance Separable (MDS) code. An existing bound on the required alphabet size for MDS code is generalized for combination network coding. Besides, a class of combination network code called Zigzag-Decodable (ZD) code is considered. It involves only exclusive-OR and bit-shifting operations and can be decoded by a fast algorithm called zigzag decoding. It was proved that the ZD code has lower encoding and decoding complexities than other existing codes, at the expense of slight rate loss.

AB - Combination network coding can be regarded as a generalization of Maximum Distance Separable (MDS) code. An existing bound on the required alphabet size for MDS code is generalized for combination network coding. Besides, a class of combination network code called Zigzag-Decodable (ZD) code is considered. It involves only exclusive-OR and bit-shifting operations and can be decoded by a fast algorithm called zigzag decoding. It was proved that the ZD code has lower encoding and decoding complexities than other existing codes, at the expense of slight rate loss.

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

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84920520554&origin=recordpage

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9784885522925

SP - 699

EP - 703

BT - Proceedings of 2014 International Symposium on Information Theory and Its Applications, ISITA 2014

PB - IEEE

Y2 - 26 October 2014 through 29 October 2014

ER -

Combination network coding: Alphabet size and zigzag decoding

Abstract

Conference

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this