Titlebook: Coding Theory and Design Theory; Part I Coding Theory Dijen Ray-Chaudhuri Conference proceedings 1990 Springer-Verlag New York, Inc. 1990 C

洞察力

enchant

https://doi.org/10.1007/978-3-030-10504-4cribe the correspondence and discuss various techniques from the algebraic topology of Spin(n) which may be useful in studying self-orthogonal codes. In particular, Quillen’s results in equivariant cohomology theory coupled with some Morse theory may allow one to address certain questions on the min

MILL

Fumitaka Abe,Masahiko Mori,Shingo NakamuraLet . be a given .-stage .-sequence over the binary field F., whose minimal polynomial will be denoted by .. We know that . is primitive and of degree .. Denote ., . ≥ 0 and call . the .-th state of the .-stage .-sequence .. Let . be a Boolean polynomial in . variables ..,..., .. and of degree .. Obviously r ≤ n.

allergy

Masahiko Otani,Lipeng Zheng,Naoto KawakamiWe prove two theorems which bound the number of pairs of unjoined points in a partial plane ∑ defined on a finite number υ of points. The bounds are obtained under assumptions on the number of lines in ∑ together with the assumption that no line contains more than υ – 3 points.

Digest

分散

Expertise

消息靈通

比喻好

Bounds on the Number of Pairs of Unjoined Points in a Partial Plane,We prove two theorems which bound the number of pairs of unjoined points in a partial plane ∑ defined on a finite number υ of points. The bounds are obtained under assumptions on the number of lines in ∑ together with the assumption that no line contains more than υ – 3 points.

手術刀