The minimum-distance conjecture for projective nested cartesian codes
Statement
Let be the sets defining a projective nested cartesian set , and let . For an integer , write for the corresponding evaluation code and for its minimum distance. When , let and be the unique integers satisfying
Minimum-distance conjecture. The minimum distance of is
The preceding lemma establishes this expression as an upper bound, while the conjecture asserts that the bound is attained. The value beyond the indicated degree range is already obtained in the proof of the upper bound; the remaining issue is equality for the first range.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.