𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Codes associated with generalized polygons

✍ Scribed by Bhaskar Bagchi; N. S. Narasimha Sastry


Publisher
Springer
Year
1988
Tongue
English
Weight
352 KB
Volume
27
Category
Article
ISSN
0046-5755

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Generating random polygons with given ve
✍ Chong Zhu; Gopalakrishnan Sundaram; Jack Snoeyink; Joseph S.B. Mitchell πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 803 KB
Spline and BΓ©zier polygons associated wi
✍ P. SablonniΓ©re πŸ“‚ Article πŸ“… 1978 πŸ› Elsevier Science 🌐 English βš– 387 KB

Parametrized polynomial spline curves are defined by an S-polygon, but locally they are Bdzier curves defined by a B-polygon. Two algorithms are given which construct one polygon from the other and vice versa. The generalization to surfaces is straightforward. This may be of some interest in CA D be

Error correcting codes associated with c
✍ I. Heng; C.H. Cooke πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 252 KB

For primes p > 2, the generalized Hadamaxd matrix H(p, pt) can be expressed as H = x A, where the notation means hij = x a~ . It is shown that the row vectors of A represent a p-ary error correcting code. Depending upon the value of t, either linear or nonlinear codes emerge. Code words are equidist

Generalized Reed–Muller Codes and Curves
✍ G van der Geer; M van der Vlugt πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 236 KB

Words of low weight in trace codes correspond to curves with many points and the same holds for subcodes of low weight via the fibre product construction. In 1996 Heijnen and Pellikaan gave an algorithm to determine a basis of minimum weight subcodes of generalized Reed Muller codes. We show how thi

Generating subroutine codes with MACSYMA
✍ Megan Florence; Stanly Steinberg; Patrick Roache πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 357 KB