✦ LIBER ✦

Bounding the Trellis State Complexity of Algebraic Geometric Codes

✍ Scribed by Carlos Munuera; Fernando Torres

Publisher: Springer
Year: 2004
Tongue: English
Weight: 203 KB
Volume: 15
Category: Article
ISSN: 0938-1279
DOI: 10.1007/s00200-004-0150-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The parameters of subcodes of algebraic-

The parameters of subcodes of algebraic-geometric codes over prime subfields

✍ Alexei N. Skorobogatov 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 842 KB

Lower bounds for the bilinear complexity

Lower bounds for the bilinear complexity of associative algebras

✍ M. Bläser 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 395 KB

Solution of elementary equations in the

Solution of elementary equations in the Minkowski geometric algebra of complex sets

✍ Rida T. Farouki; Chang Yong Han 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 515 KB

Geometrical state theory, the von neuman

Geometrical state theory, the von neumann boundary, and duality of thec-algebras

✍ A. M. Vershik 📂 Article 📅 1975 🏛 Springer US 🌐 English ⚖ 477 KB

Unstable bound states of the Dirac equat

Unstable bound states of the Dirac equation by an algebraic approach

✍ S. Kais; Shoon K. Kim 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 143 KB