Novel construction method generates optimal binary error-correcting codes using 2-sum of book graphs. Establishes matroid-theory bridge to CSS quantum codes, enabling flexible code generation across any finite field.
@informaq.bsky.social
@informaq.bsky.socialNovel construction method generates optimal binary error-correcting codes using 2-sum of book graphs. Establishes matroid-theory bridge to CSS quantum codes, enabling flexible code generation across any finite field.
@informaq.bsky.socialEstablishes Fourier-based conditions for local unitary equivalence of orthogonal arrays and irredundant orthogonal arrays, connecting LU equivalence to coding theory duality for linear codes over prime fields.
@informaq.bsky.socialFramework for quantum stabilizer codes over Gaussian integer rings, revealing distinct roles of logical and syndrome quotients in error correction with new cardinality formulas and syndrome-based recovery procedures.
@informaq.bsky.socialDiscovers infinite families of 3-designs from linear and nonlinear codes with applications to quantum error-correcting codes and distributed storage systems, achieving optimal locality and distance properties.