1999
DOI: 10.1109/18.749014
|View full text |Cite
|
Sign up to set email alerts
|

Every binary (2/sup m/-2, 2/sup 2(m)-2-m/, 3) code can be lengthened to form a perfect code of length 2/sup m/-1

Abstract: We calculate the cross sections for the production of the J/+ in nucleon-nucleon interactions on the basis of a naive Drell-Yan-type parton model where the I production is considered as production through the resonant or fusion interaction of quarks and antiquarks resident in the colliding nucleons. The interacting quarks are assumed to act as free point Dirac particles obeying the Bethe-Heitler description of annihilation to lepton pairs. Unitarity limits on I production established by calcutations conducted … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
37
0

Year Published

2009
2009
2011
2011

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(37 citation statements)
references
References 1 publication
0
37
0
Order By: Relevance
“…The perfect codes attaining A(15, 3) = 2048 were classified by the second and the third author [14]; the number of equivalence classes of such codes is 5983, with 2165 extensions. Using a result by Blackmore [3], this classification can be used to get the number of equivalence classes of codes attaining A(14, 3) = 1024, which is 38408; these have 5983 extensions. All these results still leave the classification problem open for lengths 12 and 13.…”
Section: A Survey Of Old Resultsmentioning
confidence: 99%
See 4 more Smart Citations
“…The perfect codes attaining A(15, 3) = 2048 were classified by the second and the third author [14]; the number of equivalence classes of such codes is 5983, with 2165 extensions. Using a result by Blackmore [3], this classification can be used to get the number of equivalence classes of codes attaining A(14, 3) = 1024, which is 38408; these have 5983 extensions. All these results still leave the classification problem open for lengths 12 and 13.…”
Section: A Survey Of Old Resultsmentioning
confidence: 99%
“…1 14179 64 8511 2048 39 2 45267 96 90 3072 3 3 41 128 3114 4096 9 4 66449 192 55 6144 4 6 137 256 1247 8192 1 8 44529 384 39 12288 4 12 159 512 403 16384 1 16 32193 768 35 24576 1 24 89 1024 82 73728 1 32 20813 1152 1 147456 1 48 98 1536 15 the unique (13,256,4) code that cannot be lengthened to a (14,512,4) code has an automorphism group of order 384. It turns out that one detail in [5] is incorrect: shortening the (two) (13, 512, 3) codes that cannot be lengthened to (15,2048,3) codes always leads to (12,256,3) codes that cannot be lengthened to (15,2048,3) codes.…”
Section: Properties Of the Classified Codesmentioning
confidence: 99%
See 3 more Smart Citations