This paper improves the lower bound on the maximum size of trifferent codes using a locally sparse hypergraph and the Verstraete-Wilson theorem.

The paper derives an explicit representation for the Euclidean dual of Hyperderivative Reed-Solomon codes and studies reverse self-dual HRS codes.

This paper introduces a structural theorem for the sparsifiability of real-valued codes, which generalizes both combinatorial and continuous notions of sparsification.

The paper provides the first machine-checked, tridirectional correctness proof of the OpenZeppelin reentrancy-guard pattern against complex, production-deployed Solidity smart contract source.

This paper introduces and studies the block tensor rank of sum-rank metric codes, showing its additive decomposition and deriving lower bounds.

This paper generalizes the connection between graph theory, association schemes, and coding theory to the space of tensors over a finite field, and derives the spectrum of the corresponding graph.

The paper analyzes the structured CVP distance on the log-unit lattice of cyclotomic fields, significantly reducing the conjectured CDPR factor for the ML-KEM cryptosystem from exponential to sub-poly…

This paper introduces minimal additive codes over Fqh and establishes a one-to-one correspondence between minimal additive codes and additive strong blocking sets. It also compares this framework with…

This paper presents a product coding scheme that converts bit-level reliability into block-level reliability, achieving the same asymptotic rate.

This paper systematically analyzes binomial functions over $\mathbb{F}_{p^n}$ in characteristic 3, providing a classification and rigorous proof of specific classes of exponents that yield extremely l…

This paper introduces skew CRT codes, a decoding algorithm, and the poly-skew metric for error modeling.

This paper presents a cryptanalytic attack demonstrating that a specific code-based Private Information Retrieval (PIR) scheme can be broken, allowing the server to efficiently determine the requested…

This paper introduces a symbolic diagnostic approach for investigating obstruction structures in the Collatz conjecture using finite exponent codes of the accelerated map.