摘要
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.
源语言 | 英语 |
---|---|
主期刊名 | 2014 IEEE International Symposium on Information Theory, ISIT 2014 |
出版商 | Institute of Electrical and Electronics Engineers Inc. |
页 | 2789-2793 |
页数 | 5 |
ISBN(印刷版) | 9781479951864 |
DOI | |
出版状态 | 已出版 - 2014 |
活动 | 2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, HI, 美国 期限: 29 6月 2014 → 4 7月 2014 |
出版系列
姓名 | IEEE International Symposium on Information Theory - Proceedings |
---|---|
ISSN(印刷版) | 2157-8095 |
会议
会议 | 2014 IEEE International Symposium on Information Theory, ISIT 2014 |
---|---|
国家/地区 | 美国 |
市 | Honolulu, HI |
时期 | 29/06/14 → 4/07/14 |
指纹
探究 'Notes on the pseudoredundancy' 的科研主题。它们共同构成独一无二的指纹。引用此
Liu, Z., Zumbragel, J., Greferath, M., & Wu, X. W. (2014). Notes on the pseudoredundancy. 在 2014 IEEE International Symposium on Information Theory, ISIT 2014 (页码 2789-2793). 文章 6875342 (IEEE International Symposium on Information Theory - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2014.6875342