Notes on the pseudoredundancy

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publication2014 IEEE International Symposium on Information Theory, ISIT 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2789-2793
Number of pages5
ISBN (Print)9781479951864
DOIs
Publication statusPublished - 2014
Event2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, HI, United States
Duration: 29 Jun 20144 Jul 2014

Publication series

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

Conference

Conference2014 IEEE International Symposium on Information Theory, ISIT 2014
Country/TerritoryUnited States
CityHonolulu, HI
Period29/06/144/07/14

Fingerprint

Dive into the research topics of 'Notes on the pseudoredundancy'. Together they form a unique fingerprint.

Cite this