Carvalho–Lopez-Neumann–López minimum-distance conjecture for projective nested cartesian codes
Statement
Let be a finite field, let be subsets of defining a projective nested cartesian set
and write for . Let be the corresponding -th projective nested cartesian code, and let denote its minimum distance. Carvalho–Lopez-Neumann–López's minimum-distance conjecture. The minimum distance is
where and are the unique integers such that
and . The statement was explicitly identified in the source as a conjecture, but the supplied material gives no resolution status; it is also immediately followed in the paper by a counterexample, so the status should be checked against that example.
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.