Some Results for Linear Binary Codes With Minimum Distance 5 and 6.
Uloženo v:
| Název: | Some Results for Linear Binary Codes With Minimum Distance 5 and 6. |
|---|---|
| Autoři: | Bouyukliev, Lliya1 iliya@moi.math.bas.bg, Varbanov, Zlatko2 vtgold@yahoo.com |
| Zdroj: | IEEE Transactions on Information Theory. Dec2005, Vol. 51 Issue 12, p4387-4391. 5p. |
| Témata: | *MATHEMATICAL statistics, *LINEAR programming, *MATHEMATICAL programming, CODING theory, DECODERS & decoding, MATRICES (Mathematics) |
| Abstrakt: | We prove that a linear binary code with parameters [34, 24, 5] does not exist. Also, we characterize some codes with minimum distance 5 and 6. [ABSTRACT FROM AUTHOR] |
| Copyright of IEEE Transactions on Information Theory is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Databáze: | Business Source Index |
Full Text Finder 
Nájsť tento článok vo Web of Science Buďte první, kdo okomentuje tento záznam!