Notes on the Pseudoredundancy

Zihui Liu*, Jens Zumbraegel, Marcus Greferath, Xin-Wen Wu

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

1 Citation (Scopus)

Abstract

By using the value assignment of Chen and Kløve 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)
PublisherIEEE
Pages2789-2793
Number of pages5
ISBN (Electronic)978-1-4799-5186-4
ISBN (Print)978-1-4799-5187-1
DOIs
Publication statusPublished - 2014
MoE publication typeA4 Article in a conference publication
EventIEEE International Symposium on Information Theory - Honolulu, United States
Duration: 29 Jun 20144 Jul 2014

Publication series

NameIEEE International Symposium on Information Theory
PublisherIEEE
ISSN (Print)2157-8095
ISSN (Electronic)2157-8117

Conference

ConferenceIEEE International Symposium on Information Theory
Abbreviated titleISIT
CountryUnited States
CityHonolulu
Period29/06/201404/07/2014

Keywords

  • redundancy
  • linear codes
  • generators
  • decoding
  • silicon
  • vectors

Cite this