𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounds on the minimum distance of the duals of extended BCH codes over(mathbb{F}_p )

✍ Scribed by Françoise Levy-dit-Vehel

Publisher
Springer
Year
1995
Tongue
English
Weight
738 KB
Volume
6
Category
Article
ISSN
0938-1279

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Bounds on the Minimum Distance of High D
Bounds on the Minimum Distance of High Dimensional Circular Trellis-Coded Modulation
✍ Xiangyu Song; Jeffrey Dill; Alan R. Lindsey 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 132 KB

This paper derives the upper and lower bounds on the minimum distance of 4-ary circular trellis-coded modulation using a simplex signal constellation. The bounds are shown to be tight and reachable, and the code is shown to achieve simplex distance between parallel paths at each stage of the trellis

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 .