2010 IEEE Information Theory Workshop 2010
DOI: 10.1109/cig.2010.5592905
|View full text |Cite
|
Sign up to set email alerts
|

Hecke operators with odd determinant and binary frameproof codes beyond the probabilistic bound?

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
6
0
4

Year Published

2011
2011
2021
2021

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(11 citation statements)
references
References 14 publications
1
6
0
4
Order By: Relevance
“…He encouraged me to publish all the details by myself, including heuristics and partial results supporting the underlying conjectures. I did so the year after [Ran10]. Writing everything down had a rather unexpected, happy consequence.…”
Section: A Young Arithmetic Geometer Arrives At Télécommentioning
confidence: 99%
See 1 more Smart Citation
“…He encouraged me to publish all the details by myself, including heuristics and partial results supporting the underlying conjectures. I did so the year after [Ran10]. Writing everything down had a rather unexpected, happy consequence.…”
Section: A Young Arithmetic Geometer Arrives At Télécommentioning
confidence: 99%
“…His aim was to present a new notion he called "torsion limit". I was very surprised to discover that this new notion was essentially the same that I had introduced in [Ran10], in order to measure how close to a solution of Problem 1 one could get! There was an explanation: actually, Cramer was working with Xing.…”
Section: A Young Arithmetic Geometer Arrives At Télécommentioning
confidence: 99%
“…In fact this condition A(q) > 5 can be relaxed very slightly, as shown in [29]. However, to relax it further to A(q) > 1 would require much deeper results, such as the conjectures proposed in [27] on the existence of curves having many points but few 2-torsion in their class group. This also leads to the following question: do m sym q = m q , or M sym q = M q , or more generally µ sym q (m, l) = µ q (m, l) for all q, m, l?…”
Section: Fixing Some Bounds Of Balletmentioning
confidence: 99%
“…More important, in [38], Xing studied intersecting codes arising from algebraic curves, and he gave a criterion for their existence, that reduces essentially to the second part of system (4). Hence here also the 2-torsion in the class group is an obstruction to get optimal parameters (see [27] for elaborations on this). This problem was essentially solved, or more properly, bypassed by the author in [28] with the method discussed above (although the analog problem for t-torsion, t ≥ 3, is still open).…”
Section: Introductionmentioning
confidence: 99%
“…In addition, one could repeat the analysis in alternate situations: one could treat nonprime N , work modulo another prime ℓ, consider T p for another p, and/or work in some higher weight k. While all of these variants are of intrinsic interest, we would like to point out some developments in the computation of modular forms which draw attention to some particular cases. (Separately, the case of N prime, ℓ = 2, p > 2, k = 2 has arisen in the context of error-correcting codes [28]. )…”
Section: Introductionmentioning
confidence: 99%