English
Related papers

Related papers: On correlation distribution of Niho-type decimatio…

200 papers

In this study, linear codes having their Lee-weight distributions over the semi-local ring $\mathbb{F}_{q}+u\mathbb{F}_{q}$ with $u^{2}=1$ are constructed using the defining set and Gauss sums for an odd prime $q $. Moreover, we derive…

Information Theory · Computer Science 2024-07-08 Pavan Kumar , Noor Mohammad Khan

We introduce a new framework term coding for extremal problems in discrete mathematics and information flow, where one chooses interpretations of function symbols so as to maximise the number of satisfying assignments of a finite system of…

Information Theory · Computer Science 2026-02-10 Søren Riis

Practically good error-correcting codes should have good parameters and efficient decoding algorithms. Some algebraically defined good codes such as cyclic codes, Reed-Solomon codes, and Reed-Muller codes have nice decoding algorithms.…

Information Theory · Computer Science 2019-11-19 Lucky Galvez , Jon-Lark Kim

Let $p$ be an odd prime such that $p \equiv 3\;{\rm mod}\;4$ and $n$ be an odd integer. In this paper, two new families of $p$-ary sequences of period $N = \frac{p^n-1}{2}$ are constructed by two decimated $p$-ary m-sequences $m(2t)$ and…

Information Theory · Computer Science 2013-10-11 Wijik Lee , Ji-Youp Kim , Jong-Seon No

The subject of this paper is transmission over a general class of binary-input memoryless symmetric channels using error correcting codes based on sparse graphs, namely low-density generator-matrix and low-density parity-check codes. The…

Information Theory · Computer Science 2009-03-12 Shrinivas Kudekar , Nicolas Macris

We examine various perspectives on the decay of correlation for the uniform distribution over proper $q$-edge colorings of graphs with maximum degree $\Delta$. First, we establish the coupling independence property when $q\ge 3\Delta$ for…

Data Structures and Algorithms · Computer Science 2025-06-03 Zejia Chen , Yulin Wang , Chihao Zhang , Zihan Zhang

Self-orthogonal codes are an important subclass of linear codes which have nice applications in quantum codes and lattices. It is known that a binary linear code is self-orthogonal if its every codeword has weight divisible by four, and a…

Information Theory · Computer Science 2023-11-21 Xiaoru Li , Ziling Heng

The total production cross sections of light charged particles (LCPs), intermediate mass fragments (IMFs) and heavy reaction products of p+Ni collisions available in the literature have been compared with predictions of a two-step model in…

We study the evolution of the halo-halo correlation function and bias in four cosmological models (LCDM, OCDM, tauCDM, and SCDM) using very high-resolution N-body simulations. The high force and mass resolution allows dark matter (DM) halos…

Astrophysics · Physics 2009-10-30 Pedro Colin , Anatoly Klypin , Andrey Kravtsov , Alexei Khokhlov

This paper studies growth, percolation, and correlations in disordered fiber networks. We start by introducing a 2D continuum deposition model with effective fiber-fiber interactions represented by a parameter $p$ which controls the degree…

Statistical Mechanics · Physics 2009-10-28 N. Provatas , M. Haataja , E. Seppälä , S. Majaniemi , J. Åström , M. Alava , T. Ala-Nissila

Let $G=(V,E)$ be a simple graph with $|V|=n$ nodes and $|E|=m$ links, a subset $K \subseteq V$ of \emph{terminals}, a vector $p=(p_1,...,p_m) \in [0,1]^m$ and a positive integer $d$, called \emph{diameter}. We assume nodes are perfect but…

Data Structures and Algorithms · Computer Science 2014-10-02 Eduardo Canale , Pablo Romero , Gerardo Rubino

The effective, fast transport of matter through porous media is often characterized by complex dispersion effects. To describe in mathematical terms such situations, instead of a simple macroscopic equation (as in the classical Darcy's…

Numerical Analysis · Mathematics 2025-05-06 Surendra Nepal , Vishnu Raveendran , Michael Eden , Rainey Lyons , Adrian Muntean

We prove that with high probability $G(n,p)$ with $p \geq n^{-4/11 + o(1)}$ admits a fractional triangle decomposition (FTD), i.e., a nonnegative weighting of its triangles such that for each edge, the total weight of the triangles…

Combinatorics · Mathematics 2025-11-21 Ghaura Mahabaduge , Michael Simkin

The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the…

Information Theory · Computer Science 2017-02-15 Gaopeng Jian

Our interest is in the scaled joint distribution associated with $k$-increasing subsequences for random involutions with a prescribed number of fixed points. We proceed by specifying in terms of correlation functions the same distribution…

Combinatorics · Mathematics 2007-05-23 Peter J. Forrester , Taro Nagao , Eric M. Rains

In this article we address the computational hardness of optimally decoding a quantum stabilizer code. Much like classical linear codes, errors are detected by measuring certain check operators which yield an error syndrome, and the…

Quantum Physics · Physics 2013-10-14 Pavithran Iyer , David Poulin

The explosive percolation problem on the complete graph is investigated via extensive numerical simulations. We obtain the cluster-size distribution at the moment when the cluster size heterogeneity becomes maximum. The distribution is…

Statistical Mechanics · Physics 2015-05-27 Hyun Keun Lee , Beom Jun Kim , Hyunggyu Park

A prime number $p$ is said to be irregular if it divides the class number of the $p$-th cyclotomic field $\mathbb{Q}(\zeta_{p}) = \mathbb{Q}(\mathbb{G}_m[p])$. In this paper, we study its elliptic analogue for the division fields of an…

Number Theory · Mathematics 2022-05-19 Naoto Dainobu , Yoshinosuke Hirakawa , Hideki Matsumura

Given a set $P$ of $n$ points in $\mathbf{R}^d$, and a positive integer $k \leq n$, the $k$-dispersion problem is that of selecting $k$ of the given points so that the minimum inter-point distance among them is maximized (under Euclidean…

Computational Geometry · Computer Science 2025-11-04 Ke Chen , Adrian Dumitrescu

We consider the distributed source coding problem in which correlated data picked up by scattered sensors has to be encoded separately and transmitted to a common receiver, subject to a rate-distortion constraint. Although near-tooptimal…

Information Theory · Computer Science 2008-09-09 G. Maierbacher , J. Barros
‹ Prev 1 8 9 10 Next ›