𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the parameters of codes for the Lee and modular distance

✍ Scribed by Patrick Solé

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
640 KB
Volume
89
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On computing the minimum distance of lin
On computing the minimum distance of linear codes
✍ Masami Mohri; Masakatu Morii 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB 👁 2 views

The weight distribution is an indispensable parameter in the performance evaluation of a code because of its importance in the analysis of the codes characteristics. Since the amount of computation needed to determine the overall weight distribution of a code usually depends on the number of data po

On the Non - Existence of Perfect Codes
On the Non - Existence of Perfect Codes with Rank Distance
✍ Kefei Chen 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 347 KB

Theory of codes with rank distance was introduced in 1985, which can be applied to crisscross error correction and also used to build some cryptographical schemes. We know that the existence of perfect codes is an interesting topic in coding theory; as a new type of codes, we consider the existence

New Bounds on the Distance Distribution
New Bounds on the Distance Distribution of Extended Goppa Codes
✍ Simon Litsyn; Sarit Zur 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 169 KB

We derive new estimates for the error term in the binomial approximation to the distance distribution of extended Goppa codes. This is an improvement on the earlier bounds by Vladuts and Skorobogatov, and Levy and Litsyn.