Related papers: Diagonally Neighbour Transitive Codes and Frequenc…
In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) with entries in a finite field F_q. Spread codes are a family…
We consider the problem of information flow over Gaussian relay networks. Similar to the recent work by Avestimehr \emph{et al.} [1], we propose network codes that achieve up to a constant gap from the capacity of such networks. However,…
We perform an extended numerical search for practical fermion-to-qubit encodings with error correcting properties. Ideally, encodings should strike a balance between a number of the seemingly incompatible attributes, such as having a high…
In this work, we present a conditionally stable finite-difference scheme that consistently approximates the solution of a general class of (3+1)-dimensional nonlinear equations that generalizes in various ways the quantitative model…
The sizes of optimal constant-composition codes of weight three have been determined by Chee, Ge and Ling with four cases in doubt. Group divisible codes played an important role in their constructions. In this paper, we study the problem…
The problem of correcting transpositions (or swaps) of consecutive symbols in $ q $-ary strings is studied. Lower bounds on asymptotically achievable rates of codes correcting $ t = \tau n $ transpositions are derived. The first bound is…
Structure encoding has proven to be the key feature to distinguishing links in a graph. However, Structure encoding in the temporal graph keeps changing as the graph evolves, repeatedly computing such features can be time-consuming due to…
Frequency tagging is a powerful approach to investigate the neural processing of sensory features, and is recently adapted to study the neural correlates of superordinate structures, i.e., chunks, in complex sequences such as speech and…
Families of "asymptotically regular" LDPC block code ensembles can be formed by terminating (J,K)-regular protograph-based LDPC convolutional codes. By varying the termination length, we obtain a large selection of LDPC block code ensembles…
We discuss the application of coded modulation for power-line communications. We combine M-ary FSK with diversity and coding to make the transmission robust against permanent frequency disturbances and impulse noise. We give a particular…
We demonstrate that certain Johnson-type bounds are asymptotically exact for a variety of classes of codes, namely, constant-composition codes, nonbinary constant-weight codes and multiply constant-weight codes. This was achieved via an…
We address the recently suggested problem of causal lossless coding of a randomly arriving source samples. We construct variable-to-fixed coding schemes and show that they outperform the previously considered fixed-to-variable schemes when…
We introduce the concept of generalized concatenated quantum codes. This generalized concatenation method provides a systematical way for constructing good quantum codes, both stabilizer codes and nonadditive codes. Using this method, we…
In this paper we propose a new design criterion and a new class of unitary signal constellations for differential space-time modulation for multiple-antenna systems over Rayleigh flat-fading channels with unknown fading coefficients.…
A narrow energy band of the electronic spectrum in some direction in low-dimensional crystals may lead to a negative differential conductance and N-shaped I-V curve that results in an instability of the uniform stationary state. A…
A code is called propelinear if its automorphism group contains a subgroup that acts regularly on its codewords, which is called a propelinear structure on the code. In the paper a classification of the propelinear structures on the…
A known Kronecker construction of completely regular codes has been investigated taking different alphabets in the component codes. This approach is also connected with lifting constructions of completely regular codes. We obtain several…
Nearest-neighbor coupled-mode theory is a powerful framework to describe electromagnetic-wave propagation in multicore fibers but it lacks precision as the separation between cores decreases. We use abstract symmetries to study a ring of…
Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from…
Tree codes, introduced by Schulman, are combinatorial structures essential to coding for interactive communication. An infinite family of tree codes with both rate and distance bounded by positive constants is called asymptotically good.…