A new boosting algorithm that strong learns concept classes closed under O(log 1/γ)-XOR using O(log 1/ε) calls to a γ-advantage weak learner and additional samples, by connecting boosting with list-de…

This paper proposes a novel Simultaneous Data Compression and Encryption (SDCE) system that combines chaotic map-based encryption with Huffman encoding to securely and efficiently transmit large video…

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 a symbolic diagnostic approach for investigating obstruction structures in the Collatz conjecture using finite exponent codes of the accelerated map.

This paper proves that random linear codes have nearly optimal discrepancy properties in various regimes, extending classical results and enabling new applications.

DuCodeMark introduces a robust, dual-purpose watermarking technique that embeds ownership signals into code datasets, ensuring protection across both source-code generation and decompilation tasks.

The paper proves that generalized skew and linearized Reed-Solomon (GSRS and GLRS) codes, while promising for cryptosystems, are structurally weak and can be efficiently distinguished from random code…

This paper establishes a Coding Theorem in the context of symmetry groups and develops a connection between subgroups of a group and subsets of binary strings.

The paper provides distinguishers for McEliece type cryptosystems with larger row and column weights, and presents a framework to turn distinguishers into key-recovery attacks. It successfully attacks…

MATRIX is a novel, robust code watermarking framework that encodes watermarks using constrained parity-check matrix equations, achieving high detection accuracy and improved robustness for code proven…

The paper proposes an efficient and provably secure linguistic steganography method using range coding that achieves high embedding capacity and speed, outperforming existing methods.

The paper proposes a novel method using random walks and equitable partitions to derive an inequality for the total variation distance of codes, generalizing existing bounds for finite abelian groups.

The paper proposes a novel global sketch-based watermarking technique for diffusion language models that controls the entire sequence's statistics, offering an order-agnostic and context-independent a…

This paper develops a new decoding algorithm for Desarguesian spread codes to uniquely decode in the presence of insertions and deletions, even when the sum of their dimensions exceeds half the minimu…

This paper proves that for any finite abelian group, there exists a spectral sparsifier for its Cayley graph with log(|G|) generators. This result improves upon previous work for constructing code spa…

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

The paper proposes SSG, a novel logit-balanced vocabulary partitioning method, to enhance the watermark strength and detectability of LLM-generated content, especially in low-entropy domains like code…