English
Related papers

Related papers: Multilevel constructions: coding, packing and geom…

200 papers

Using computed x-ray tomography we determine the three dimensional (3d) structure of binary hard sphere mixtures as a function of composition and size ratio of the particles, q. Using a recently introduced four-point correlation function we…

Soft Condensed Matter · Physics 2023-02-15 Houfei Yuan , Zhen Zhang , Walter Kob , Yujie Wang

The purpose of this work is two-fold. First, we introduce an efficient homogenization-based approach to perform topology optimization of coated structures with orthotropic infill material. By making use of the relaxed design space, we can…

Computational Engineering, Finance, and Science · Computer Science 2018-08-15 Jeroen Groen , Jun Wu , Ole Sigmund

Lattice models or structures are geometrical objects with mathematical forms, that are used to represent physical systems. They have been used widely in diverse fields, namely, in condensed matter physics, to study degrees of freedom of…

Quantum Physics · Physics 2024-06-04 Kalyan Dasgupta

We use the theory of hyperplane arrangements to construct natural bases for the homology of partition lattices of types A, B and D. This extends and explains the "splitting basis" for the homology of the partition lattice given in [Wa96],…

Combinatorics · Mathematics 2007-05-23 Anders Björner , Michelle L. Wachs

The design space for a self-assembled multicomponent objects ranges from a solution in which every building block is unique to one with the minimum number of distinct building blocks that unambiguously define the target structure. Using a…

Soft Condensed Matter · Physics 2023-03-13 Joakim Bohlin , Andrew J. Turberfield , Ard A. Louis , Petr Šulc

Binary linear codes with good parameters have important applications in secret sharing schemes, authentication codes, association schemes, and consumer electronics and communications. In this paper, we construct several classes of binary…

Information Theory · Computer Science 2016-12-15 Deng Tang , Claude Carlet , Zhengchun Zhou

The low-density parity-check (LDPC) lattices perform very well in high dimensions under generalized min-sum iterative decoding algorithm. In this work we focus on 1-level LDPC lattices. We show that these lattices are the same as lattices…

Information Theory · Computer Science 2013-02-05 Mohammad-Reza Sadeghi , Amin Sakzad

For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight…

Information Theory · Computer Science 2016-02-03 Fei Li , Yang Yan , Qiuyan Wang , Tongjiang Yan

Multiple beamforming is realized by singular value decomposition of the channel matrix which is assumed to be known to both the transmitter and the receiver. Bit-Interleaved Coded Multiple Beamforming (BICMB) can achieve full diversity as…

Information Theory · Computer Science 2012-08-17 Boyu Li , Hong Ju Park , Ender Ayanoglu

Bilevel optimization formulates hierarchical decision-making processes that arise in many real-world applications such as in pricing, network design, and infrastructure defense planning. In this paper, we consider a class of bilevel…

Optimization and Control · Mathematics 2021-04-20 Geunyeong Byeon , Pascal Van Hentenryck

Spatially coupled low-density parity-check (SC-LDPC) codes are sparse graph codes that have recently become of interest due to their capacity-approaching performance on memoryless binary input channels. In this paper, we unify all existing…

Information Theory · Computer Science 2017-10-11 Allison Beemer , Salman Habib , Christine A. Kelley , Joerg Kliewer

We study the performance of binary spatially-coupled low-density parity-check codes (SC-LDPC) when used with bit-interleaved coded-modulation (BICM) schemes. This paper considers the cases when transmission takes place over additive white…

Information Theory · Computer Science 2013-03-05 Arvind Yedla , Mostafa El-Khamy , Jungwon Lee , Inyup Kang

Suppose L and M are full-rank lattices in Euclidean space, such that vol(L) < vol(M). Answering a question of Han and Wang from 2001, we show how to construct a bounded measurable set F (we can even take F to be a finite union of polytopes)…

Classical Analysis and ODEs · Mathematics 2025-09-25 Sigrid Grepstad , Mihail N. Kolountzakis , Emmanuil Spyridakis

The problem of packing ellipsoids of different sizes and shapes into an ellipsoidal container so as to minimize a measure of overlap between ellipsoids is considered. A bilevel optimization formulation is given, together with an algorithm…

Optimization and Control · Mathematics 2012-04-03 Caroline Uhler , Stephen J. Wright

We study the two-dimensional hierarchical rectangle packing problem, motivated by applications in analog integrated circuit layout, facility layout, and logistics. Unlike classical strip or bin packing, the dimensions of the container are…

Computational Geometry · Computer Science 2025-12-24 Josef Grus , Zdeněk Hanzálek , Christian Artigues , Cyrille Briand , Emmanuel Hebrard

Linear codes play a central role in coding theory and have applications in several branches of mathematics. For error correction purposes the minimum Hamming distance should be as large as possible. Linear codes related to applications in…

Information Theory · Computer Science 2025-02-19 Sascha Kurz

A recent line of work on lattice codes for Gaussian wiretap channels introduced a new lattice invariant called secrecy gain as a code design criterion which captures the confusion that lattice coding produces at an eavesdropper. Following…

Number Theory · Mathematics 2013-04-17 Fuchun Lin , Frédérique Oggier , Patrick Solé

We present a multi-phase design parameterization to obtain optimized heterogeneous lattice structures. The 3D domain is discretized into a cubical grid wherein each cube has eight distinct unit cell types or phases. When all phases are…

Materials Science · Physics 2021-03-04 Yash Agrawal , G. K. Ananthasuresh

For finite geometry low-density parity-check codes, heavy row and column weights in their parity check matrix make the decoding with even Min-Sum (MS) variants computationally expensive. To alleviate it, we present a class of hybrid schemes…

Information Theory · Computer Science 2009-07-02 Guangwen Li , Dashe Li , Yuling Wang , Wenyan Sun

Constant dimension codes (CDCs), as special subspace codes, have received a lot of attention due to their application in random network coding. This paper introduces a family of new codes, called rank metric codes with given ranks (GRMCs),…

Combinatorics · Mathematics 2019-11-06 Shuangqing Liu , Yanxun Chang , Tao Feng