Notes on the Pseudoredundancy
No Thumbnail Available
File version
Author(s)
Liu, Z
Zumbragel, J
Greferath, M
Wu, XW
Zumbragel, J
Greferath, M
Wu, XW
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Yingbin Liang
Date
2014
Size
File type(s)
Location
Honolulu, Hawaii, USA
License
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.
Journal Title
Conference Title
IEEE International Symposium on Information Theory - Proceedings
Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject
Coding, information theory and compression