تقرير
Weight Spectrum of Quasi-Perfect Binary Codes with Distance 4
| العنوان: | Weight Spectrum of Quasi-Perfect Binary Codes with Distance 4 |
|---|---|
| المؤلفون: | Afanassiev, Valentine B., Davydov, Alexander A. |
| سنة النشر: | 2017 |
| المجموعة: | Computer Science Mathematics |
| مصطلحات موضوعية: | Computer Science - Information Theory, 94B05 |
| الوصف: | We consider the weight spectrum of a class of quasi-perfect binary linear codes with code distance 4. For example, extended Hamming code and Panchenko code are the known members of this class. Also, it is known that in many cases Panchenko code has the minimal number of weight 4 codewords. We give exact recursive formulas for the weight spectrum of quasi-perfect codes and their dual codes. As an example of application of the weight spectrum we derive a lower estimate for the conditional probability of correction of erasure patterns of high weights (equal to or greater than code distance). Comment: 5 pages, 11 references, 2 tables; some explanations and detail are added |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/1703.04106 |
| رقم الأكسشن: | edsarx.1703.04106 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |