On the normality of (non-mixed and mixed) optimal covering codes

Kéri, Gerzson (2010) On the normality of (non-mixed and mixed) optimal covering codes. In: 19th International symposium on mathematical theory of networks and systems. MTNS 2010. Budapest, 2010..

Full text not available from this repository.

Abstract

According to the experiences, it is a known fact that some essential features of normal codes are quite different for binary and for non-binary codes. After giving some explanation concerning this observation by referring to an old conjecture with its partial proof, its possible extensions and restrictions, and by giving some counterexamples in Section 3, subsequently an interesting inequality between the minimum distance and covering radius of normal codes is expounded in Section 4, which provides a lucid explanation for the observed dissimilarity between the behavior of binary and non-binary codes.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: covering codes, normal codes, inequalities for codes
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Research Laboratory on Engineering & Management Intelligence
Depositing User: Eszter Nagy
Date Deposited: 12 Dec 2012 08:38
Last Modified: 12 Dec 2012 08:38
URI: http://eprints.sztaki.hu/id/eprint/6356

Update Item Update Item