Track papers across labs, topics, and trends.
Search papers, labs, and topics across Lattice.
Address:
2
0
0
Hypergraphic polymatroids reveal that an additive code's critical exponent is dictated by the weak chromatic number of its associated hypergraph.
Linear codes universally obey the fundamental bound $d_t(\mathcal{C}) \le 2R_t(\mathcal{C}) + 2$, definitively settling the generalized packing-covering conjecture across all finite fields and orders.