✦ LIBER ✦

On the number of information symbols in Bose-Chaudhuri codes

✍ Scribed by Henry B. Mann

Book ID: 114036388
Publisher: Elsevier Science
Year: 1962
Weight: 332 KB
Volume: 5
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(62)90298-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Minimum Distance of Bose-Chaudhur

On the Minimum Distance of Bose-Chaudhuri-Hocquenghem Codes

✍ Vincent Lum and R. T. Chien 📂 Article 📅 1968 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 357 KB

Comments on "The weight structure of som

Comments on "The weight structure of some Bose-Chaudhuri codes" by Goldman, H. D., Kilman, M., and Smola, H.

✍ Lum, V. 📂 Article 📅 1969 🏛 IEEE 🌐 English ⚖ 281 KB

On the locality of codeword symbols in n

On the locality of codeword symbols in non-linear codes

✍ Forbes, Michael; Yekhanin, Sergey 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 375 KB

On reducing the number of stack symbols

On reducing the number of stack symbols in a PDA

✍ Jonathan Goldstine; John K. Price; Detlef Wotschke 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 735 KB

On the number of occurrences of a symbol

On the number of occurrences of a symbol in words of regular languages

✍ Alberto Bertoni; Christian Choffrut; Massimiliano Goldwurm; Violetta Lonati 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 351 KB

On the maximum number of different order

On the maximum number of different ordered pairs of symbols in sets of latin squares

✍ Jeffrey H. Dinitz; Douglas R. Stinson 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB 👁 1 views

## Abstract In this paper, we study the problem of constructing sets of __s__ latin squares of order __m__ such that the average number of different ordered pairs obtained by superimposing two of the __s__ squares in the set is as large as possible. We solve this problem (for all __s__) when __m__