13 papers · ranked by Valyu relevance
Leopold Bertholet, Chloe Makdad, Stephen Mackes, Daniel Chew + 1 more
This work introduces coset Bombe codes, a novel class of multilevel coset codes that generalize polar codes to dense lattice structures. By leveraging multilevel coding with non-binary codes designed for the lattice modulations and making use of Voronoi shaping, Bombe codes integrate the geometric strengths of dense…
Juliana G. F. Souza, Conghui Li, Cong Ling
We construct multilevel lattice codes from multiquadratic number fields for the compound block-fading wiretap channel. More precisely, we specialize Construction $π_A$ over the ring of integers $\mathcal{O}_K$ and exploit rational primes that split completely in $K$ to obtain a Chinese Remainder Theorem (CRT)…
Mohamed Siala, Abdullah Al-Nafisah, Tareq Y. Al-Naffouri
Nyquist Signaling Modulations (NSMs) are a novel signaling paradigm inspired by fasterthan-Nyquist principles but following a fundamentally different approach that enables controlled inter-symbol interference through carefully designed finite-impulse-response filters. NSMs can be realized in one-, two-, and…
Shuiyin Liu, Amin Sakzad
—We propose a maximum toroidal distance (MTD) code for lattice-based public-key encryption (PKE). By formulating the encryption encoding problem as the selection of 2 ℓ points in the discrete ℓ-dimensional torus Z ℓ q , the proposed construction maximizes the minimum L2-norm toroidal distance to reduce the decryption…
Muhammed Yusuf Şener, Gerhard Kramer, Shlomo Shamai (Shitz), Ronald Böhnke + 2 more
Dirty paper coding (DPC) is applied to multi-input multi-output (MIMO) broadcast channels with additive Gaussian noise and one message per receiver. The method decomposes each receiver MIMO channel into parallel scalar channels and applies modulo operators, amplitude-shift keying (ASK), and probabilistic shaping. The…
Eman F. Mohommed, jalal Abd Jassim
This paper studies a new family of polyominoes. The family is defined through a graphic representation called James diagram, also known as the nested chain abacus. This form is referred to as the Ω-nested Abacus. The proposed class is defined by geometric constraints satisfied by sets of rows, columns, and chains.…
Kees Schouhamer Immink, Jos H. Weber, Tuan Thanh Nguyen, Kui Cai + 2 more
The design of low-complexity and efficient constrained codes has been a major research item for many years. This paper reports on a versatile method named concatenated constrained codes for designing efficient fixed-length constrained codes with small complexity. A concatenated constrained code comprises two (or more)…
Ying Chen, Jianrong Bao, Yanhai Shang, Chao Liu + 5 more
To obtain efficient channel codes with high power efficiency at moderate signal-to-noise ratios (SNRs), an efficient high-rate protograph quasi-cyclic (QC) low-density parity-check (LDPC) codes is optimally constructed. By an optimized protograph template, the code framework is firstly produced by the extensions of the…
Xinyuanmeng Yao, Xiao Ma
This paper first presents a new approach to evaluating the descriptive complexity of finite-length binary sequences. Specifically, we investigate the sequence-wise recovery behavior induced by polar compression and successive cancellation decoding (SCD), and define the polar complexity of a sequence as the minimum…
Authors not listed
The Hidden Subgroup Problem (HSP) unifies several landmark quantum algorithms, yet systematic exploration of its variants and modern applications has slowed. This paper revives HSP-based algorithm design by examining new group structures with direct relevance to post-quantum cryptography, lattice problems, and…
Linlin Wang, Zuling Chang, Boris Ryabko
Linearly homomorphic signatures (LHSs) are widely used in scenarios such as network coding and the Internet of Things, but their security faces the serious threat of key leakage. To address this issue, this paper introduces a forward secure mechanism into LHSs, aiming to construct a linearly homomorphic signature (LHS)…
Lihong Cao
The human brain encodes a virtually infinite repertoire of semantic concepts using a finite number of neurons, a feat that defies the capacity limits of classical attractor networks. While “Concept Cells” in the medial temporal lobe (MTL) exhibit extreme sparsity, the information-theoretic principles governing their…
Authors not listed
This work establishes theoretical foundations for hierarchical quantum-classical algorithm design, where complex problems are decomposed across multiple spatial, temporal, or organizational scales with quantum and classical computation assigned to appropriate levels. We develop a mathematical framework that…