✦ LIBER ✦

On minimum weight codewords in QR codes

✍ Scribed by Donald W Newhart

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 927 KB
Volume: 48
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(88)90078-7

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

Small weight codewords in the LDPC codes

Small weight codewords in the LDPC codes arising from linear representations of geometries

✍ V. Pepe; L. Storme; G. Van de Voorde 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB

## Abstract In this article, we investigate the minimum distance and small weight codewords of the LDPC codes of linear representations, using only geometrical methods. First, we present a new lower bound on the minimum distance and we present a number of cases in which this lower bound is sharp. T

On computing the number of code words wi

On computing the number of code words with minimum weight for cyclic codes

✍ Masami Mohri; Masakatsu Morii 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 264 KB 👁 2 views

The weight distribution is an important parameter that determines the performance of a code. The minimum distance and the number of corresponding codes that can be derived from the weight distribution, greatly affect the performance of the code. The decoding error probability and other performance m

On weights in duadic codes

✍ Vera Pless; John Myron Masley; Jeffrey S Leon 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 736 KB

The optimality of Feng–Rao designed mini

The optimality of Feng–Rao designed minimum distance for Hermitian codes constructed by weight order based on pole order

✍ Daisuke Umehara; Shinji Miura; Tomohiko Uyematsu; Eiji Okamoto 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 313 KB 👁 2 views

The algebraic geometric code is known as a linear code that guarantees a relatively large minimum distance under the condition that the number of check symbols is kept constant, when the code length is long. Recently, Saints and Heegard presented a unified theory for decoding of the algebraic geomet

On finding a minimum spanning tree in a

On finding a minimum spanning tree in a network with random weights

✍ Colin McDiarmid; Theodore Johnson; Harold S. Stone 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 221 KB 👁 2 views

We investigate Prim's standard ''tree-growing'' method for finding a minimum spanning tree, when applied to a network in which all degrees are about d and the edges e Ž . have independent identically distributed random weights w e . We find that when the kth ' Ž . edge e is added to the current tree