𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the dual distance and the gap of a binary code

✍ Scribed by Patrick Solé; Jean-Pierre Tillicb

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
258 KB
Volume
192
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

The coset graph of a nondegenerate cyclic code is orbital regular. This yields a lower bound on its average distance, a parameter which measures the average distortion of a code used in data compression. Using results of Shahrokhi and Sz&kely we generalize this bound to binary codes with a transitive automorphism group.

📜 SIMILAR VOLUMES

Upper Bounds on the Covering Radius of a
Upper Bounds on the Covering Radius of a Code with a Given Dual Distance
✍ S. Litsyn; A. Tietäväinen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 235 KB

We derive new upper bounds on the covering radius of a binary linear code as a function of its dual distance and dual-distance width . These bounds improve on the Delorme -Sole ´ -Stokes bounds , and in a certain interval for binary linear codes they are also better than Tieta ¨ va ¨ inen's bound .

On the covering radius of an unrestricte
On the covering radius of an unrestricted code as a function of the rate and dual distance
✍ Simon Litsyn; Patrick Solé; René Struik 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 846 KB

We present a uniform approach towards deriving upper bounds on the covering radius of a code as a function of its dual distance structure and its cardinality. We show that the bounds obtained previously by Delsarte, Helleseth et al.. TietGiinen, resp. Solt-and Stokes follow as special cases. Moreove

On the maximum cardinality of binary con
On the maximum cardinality of binary constant weight codes with prescribed distance
✍ Cornelis de Vroedt 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 293 KB

De Vroedt, C., On the maximum cardinality of binary constant weight codes with prescribed distance, Discrete Mathematics 97 (1991) 155-160. Let A(n, d, w) be the maximum cardinality of a binary code with length n, constant weight w (0 G w < [n/2]) and Hamming distance d. In this paper a method is di

On the distance distribution of homogene
On the distance distribution of homogeneous codes
✍ Wolfgang Knapp 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 124 KB

Marhemar~sche~ [nrdtur der Univers,:iit T;~hip~cn. Auf der 'vlor~e~tetle i~J. ;4r~h TiJha~en i. Federal Repl,hlic o[ Germany Received 12 Deccmbq.r ;978 Revised 2 ,'~pri] i979 A c~}de C is Lal'ed homogeneous if the distances ~f c~lde w¢~rds are equally distributed am(in\*: the co ~rdinates It is ~how

The Existence of a Self-Dual [70, 35, 12
The Existence of a Self-Dual [70, 35, 12] Code and Formally Self-Dual Codes
✍ Masaaki Harada 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 224 KB

In this note, the existence of self-dual codes and formally self-dual even codes is investigated. A construction for self-dual codes is presented, based on extending generator matrices. Using this method, a singly-even self-dual [70, 35, code is constructed from a self-dual code of length 68. This i