Notes on the pseudoredundancy

Zihui Liu; Jens Zumbragel; Marcus Greferath; Xin Wen Wu

doi:10.1109/ISIT.2014.6875342

Notes on the pseudoredundancy

Zihui Liu, Jens Zumbragel, Marcus Greferath, Xin Wen Wu

School of Mathematics and Statistics

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

1 Citation (Scopus)

Abstract

By using the value assignment of Chen and Klove we present new results on the pseudocodeword redundancy of binary linear codes. In particular, we give some upper bounds on the pseudoredundancies of certain codes with repeated coordinates and of certain shortened subcodes. We also investigate several kinds of k-dimensional binary codes and compute their exact pseudocodeword redundancy.

Original language	English
Title of host publication	2014 IEEE International Symposium on Information Theory, ISIT 2014
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2789-2793
Number of pages	5
ISBN (Print)	9781479951864
DOIs	https://doi.org/10.1109/ISIT.2014.6875342
Publication status	Published - 2014
Event	2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, HI, United States Duration: 29 Jun 2014 → 4 Jul 2014

Publication series

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

Conference

Conference	2014 IEEE International Symposium on Information Theory, ISIT 2014
Country/Territory	United States
City	Honolulu, HI
Period	29/06/14 → 4/07/14

Access to Document

10.1109/ISIT.2014.6875342

Cite this

Liu, Z., Zumbragel, J., Greferath, M., & Wu, X. W. (2014). Notes on the pseudoredundancy. In 2014 IEEE International Symposium on Information Theory, ISIT 2014 (pp. 2789-2793). Article 6875342 (IEEE International Symposium on Information Theory - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2014.6875342

@inproceedings{800fe4bfd7ca42ea86df4f637f4a086d,

title = "Notes on the pseudoredundancy",

abstract = "By using the value assignment of Chen and Klove we present new results on the pseudocodeword redundancy of binary linear codes. In particular, we give some upper bounds on the pseudoredundancies of certain codes with repeated coordinates and of certain shortened subcodes. We also investigate several kinds of k-dimensional binary codes and compute their exact pseudocodeword redundancy.",

author = "Zihui Liu and Jens Zumbragel and Marcus Greferath and Wu, {Xin Wen}",

year = "2014",

doi = "10.1109/ISIT.2014.6875342",

language = "English",

isbn = "9781479951864",

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

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

pages = "2789--2793",

booktitle = "2014 IEEE International Symposium on Information Theory, ISIT 2014",

address = "United States",

note = "2014 IEEE International Symposium on Information Theory, ISIT 2014 ; Conference date: 29-06-2014 Through 04-07-2014",

}

Liu, Z, Zumbragel, J, Greferath, M & Wu, XW 2014, Notes on the pseudoredundancy. in 2014 IEEE International Symposium on Information Theory, ISIT 2014., 6875342, IEEE International Symposium on Information Theory - Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 2789-2793, 2014 IEEE International Symposium on Information Theory, ISIT 2014, Honolulu, HI, United States, 29/06/14. https://doi.org/10.1109/ISIT.2014.6875342

Notes on the pseudoredundancy. / Liu, Zihui; Zumbragel, Jens; Greferath, Marcus et al.
2014 IEEE International Symposium on Information Theory, ISIT 2014. Institute of Electrical and Electronics Engineers Inc., 2014. p. 2789-2793 6875342 (IEEE International Symposium on Information Theory - Proceedings).

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

TY - GEN

T1 - Notes on the pseudoredundancy

AU - Liu, Zihui

AU - Zumbragel, Jens

AU - Greferath, Marcus

AU - Wu, Xin Wen

PY - 2014

Y1 - 2014

N2 - By using the value assignment of Chen and Klove we present new results on the pseudocodeword redundancy of binary linear codes. In particular, we give some upper bounds on the pseudoredundancies of certain codes with repeated coordinates and of certain shortened subcodes. We also investigate several kinds of k-dimensional binary codes and compute their exact pseudocodeword redundancy.

AB - By using the value assignment of Chen and Klove we present new results on the pseudocodeword redundancy of binary linear codes. In particular, we give some upper bounds on the pseudoredundancies of certain codes with repeated coordinates and of certain shortened subcodes. We also investigate several kinds of k-dimensional binary codes and compute their exact pseudocodeword redundancy.

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

U2 - 10.1109/ISIT.2014.6875342

DO - 10.1109/ISIT.2014.6875342

M3 - Conference contribution

AN - SCOPUS:84906534085

SN - 9781479951864

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2789

EP - 2793

BT - 2014 IEEE International Symposium on Information Theory, ISIT 2014

PB - Institute of Electrical and Electronics Engineers Inc.

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

Y2 - 29 June 2014 through 4 July 2014

ER -

Notes on the pseudoredundancy

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this