𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounding minimum distances of cyclic codes using algebraic geometry

✍ Scribed by Nigel Boston

Book ID
108497974
Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
527 KB
Volume
6
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Description of Minimum Weight Codewords
Description of Minimum Weight Codewords of Cyclic Codes by Algebraic Systems
✍ Daniel Augot πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 272 KB

We consider cyclic codes of length n over ‫ކ‬ q , n being prime to q. For such a cyclic code C, we describe a system of algebraic equations, denoted by S C (w), where w is a positive integer. The system is constructed from Newton's identities, which are satisfied by the elementary symmetric function

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