✦ LIBER ✦

Good equidistant codes constructed from certain combinatorial designs

✍ Scribed by K. Sinha; Z. Wang; D. Wu

Book ID: 108113887
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 162 KB
Volume: 308
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2007.08.022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A construction for authentication/secrec

A construction for authentication/secrecy codes from certain combinatorial designs

✍ D. R. Stinson 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 532 KB

Quorum Systems Constructed from Combinat

Quorum Systems Constructed from Combinatorial Designs

✍ Charles J Colbourn; Jeffrey H Dinitz; Douglas R Stinson 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 121 KB

On the equivalence of certain constant w

On the equivalence of certain constant weight codes and combinatorial designs

✍ Victor A. Zinoviev 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 266 KB

## Stinson and van Rees (Combinatorica (1984), 357-362) proved that the existence of an equidistant code E: (n = 4s + 1,d = 2s, N) with N = n implies the existence of a certain symmetrical BIB design. This result is extended here for the constant weight codes with the same n and d. A theorem on t

Self-Orthogonal and Self-Dual Codes Cons

Self-Orthogonal and Self-Dual Codes Constructed via Combinatorial Designs and Diophantine Equations

✍ S. Georgiou; C. Koukouvinos 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 153 KB

Using combinatorial optimization to desi

Using combinatorial optimization to design good unit-memory convolutional codes

✍ Said, A.; Palazzo, R., Jr. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 770 KB

On the Minimum Weight of Codes over F5Co

On the Minimum Weight of Codes over F5Constructed from Certain Conference Matrices

✍ T. Aaron Gulliver; Masaaki Harada 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 95 KB