Matching Tag: subfield-codes
Let D = Δ M 1 + η Δ M 2 + ⋯ + η n − 1 Δ M n ⊂ F 2 n m D=\Delta_{M_1}+\eta\Delta_{M_2}+\cdots+\eta^{n-1}\Delta_{M_n}\subset\mathbb{F}_{2^n}^m D = Δ M 1 + η Δ M 2 + ⋯ + η n − 1 Δ M n ⊂ F 2 n m be as above, with the hypotheses stated in the source, and let C D c ( 2 ) C^{(2)}_{D^c} C D c ( 2 ) be the a…
Let q = 2 m q=2^m q = 2 m , with m ≡ 3 ( m o d 4 ) m\equiv 3\pmod 4 m ≡ 3 ( mod 4 ) and m ≥ 5 m\geq 5 m ≥ 5 , and define … Let C ( f , q ) ( 2 ) {\mathcal{C}}_{(f,q)}^{(2)} C ( f , q ) ( 2 ) be the associated binary subfield code. Nine-weight conjecture. The code…
Let q = 2 m q=2^m q = 2 m , and let C ( f , q ) ( 2 ) {\mathcal{C}}_{(f,q)}^{(2)} C ( f , q ) ( 2 ) be the binary subfield code defined by the trace representation for an oval polynomial f f f . Nine-weight conjecture. For odd…