English
Related papers

Related papers: Dimensions of Some Binary Codes Arising From A Con…

200 papers

This is a companion paper of arXiv:1901.09461, where different notions of dimension for triangulated categories are discussed. Here we compute dimensions for some examples of triangulated categories and thus illustrate and motivate material…

Algebraic Geometry · Mathematics 2020-04-10 Alexey Elagin

This paper consists of three parts. The first part presents a large class of new binary quasi-cyclic (QC)-LDPC codes with girth of at least 6 whose parity-check matrices are constructed based on cyclic subgroups of finite fields.…

Information Theory · Computer Science 2015-03-14 Li Zhang , Shu Lin , Khaled Abdel-Ghaffar , Zhi Ding , Bo Zhou

We give an explicit construction of length-$n$ binary codes capable of correcting the deletion of two bits that have size $2^n/n^{4+o(1)}$. This matches up to lower order terms the existential result, based on an inefficient greedy choice…

Information Theory · Computer Science 2020-07-22 Venkatesan Guruswami , Johan Håstad

We study the fine geometric structure of bifurcation currents in the parameter space of cubic polynomials viewed as dynamical systems. In particular we prove that these currents have some laminar structure in a large region of parameter…

Dynamical Systems · Mathematics 2007-05-23 Romain Dujardin

Polycyclic codes offer a natural generalization of cyclic codes and provide a broader algebraic framework for constructing linear codes with good parameters. In this paper, we study binary polycyclic codes associated with powers of…

Information Theory · Computer Science 2026-05-13 Sujata Bansal , Pramod Kumar Kewat

We describe an approach to logarithmic conformal field theories as limits of sequences of ordinary conformal field theories with varying central charge c. Logarithmic behaviour arises from degeneracies in the spectrum of scaling dimensions…

Statistical Mechanics · Physics 2013-11-25 John Cardy

We construct linear codes over the finite field Fq from arbitrary simplicial complexes, establishing a connection between topological properties and fundamental coding parameters. First, we study the behaviour of the weights of codewords…

Information Theory · Computer Science 2026-03-05 Antonio Jesús Lorite López , Daniel Camazón Portela , Juan Antonio López Ramos

Let $P$ be a set of $m$ points and $L$ a set of $n$ lines in $\mathbb R^4$, such that the points of $P$ lie on an algebraic three-dimensional surface of degree $D$ that does not contain hyperplane or quadric components, and no 2-flat…

Combinatorics · Mathematics 2016-09-29 Micha Sharir , Noam Solomon

A code C is Z2Z4-additive if the set of coordinates can be partitioned into two subsets X and Y such that the punctured code of C by deleting the coordinates outside X (respectively, Y) is a binary linear code (respectively, a quaternary…

Information Theory · Computer Science 2009-06-04 Cristina Fernandez-Cordoba , Jaume Pujol , Merce Villanueva

Given an irreducible representation of $SL_2(F_q)$ for an odd prime $q\geq 5$, we find the dimension of the space of cusp forms with respect to the full modular group taking values in the representation space. The dimension equals the…

Number Theory · Mathematics 2024-08-01 Darshan Nasit

Recently, linear codes with a few weights were widely investigated due to their applications in secret sharing schemes and authentication schemes. In this letter, we present a class of $q$-ary linear codes derived from irreducible cyclic…

Information Theory · Computer Science 2016-04-18 Ziling Heng , Qin Yue

We consider (symmetric, non-degenerate) bilinear spaces over a finite field and investigate the properties of their $\ell$-complementary subspaces, i.e., the subspaces that intersect their dual in dimension $\ell$. This concept generalizes…

Information Theory · Computer Science 2022-12-16 Heide Gluesing-Luerssen , Alberto Ravagnani

In this paper, the concept of the {\it broken diagonal pair} in the chess-like square board is used to define some well-structured block designs whose incidence matrices can be considered as the parity-check matrices of some high rate cycle…

Information Theory · Computer Science 2014-03-25 Mohammad Gholami , Ghaffar Raeisi

Due to their capacity approaching performance low-density parity-check (LDPC) codes gained a lot of attention in the last years. The parity-check matrix of the codes can be associated with a bipartite graph, called Tanner graph. To decrease…

Information Theory · Computer Science 2025-07-02 Elisa Junghans , Julia Lieb

Combinatorial designs are closely related to linear codes. In recent year, there are a lot of $t$-designs constructed from certain linear codes. In this paper, we aim to construct $2$-designs from binary three-weight codes. For any binary…

Information Theory · Computer Science 2023-12-22 Canze Zhu , Qunying Liao , Haibo Liu

A binary code is said to be a disjunctive list-decoding $s_L$-code, $s\ge1$, $L\ge1$, (briefly, LD $s_L$-code) if the code is identified by the incidence matrix of a family of finite sets in which the union of any $s$ sets can cover not…

Information Theory · Computer Science 2014-07-10 A. G. Dyachkov , I. V. Vorobyev , N. A. Polyanskii , V. Yu. Shchukin

We generalized to higher dimensions the notions of optical orthogonal codes. We establish uper bounds on the capacity of general $ n $-dimensional OOCs, and on specific types of ideal codes (codes with zero off-peak autocorrelation). The…

Combinatorics · Mathematics 2022-07-18 Tim Alderson

In the literature, lines of the projective space $\mathrm{PG}(3,q)$ are partitioned into classes, each of which is a union of line orbits under the stabilizer group of the twisted cubic. The least studied class is named $\mathcal{O}_6$.…

Combinatorics · Mathematics 2024-09-17 Alexander A. Davydov , Stefano Marcugini , Fernanda Pambianco

Double circulant codes of length $2n$ over the semilocal ring $R = \mathbb{F}_q + u\mathbb{F}_q,\, u^2=u,$ are studied when $q$ is an odd prime power, and $-1$ is a square in $\mathbb{F}_q.$ Double negacirculant codes of length $2n$ are…

Information Theory · Computer Science 2018-06-11 Minjia Shi , Hongwei Zhu , Liqin Qian , Lin Sok , Patrick Solé

We propose a technique to design finite-length irregular low-density parity-check (LDPC) codes over the binary-input additive white Gaussian noise (AWGN) channel with good performance in both the waterfall and the error floor region. The…

Information Theory · Computer Science 2016-11-17 Reza Asvadi , Amir H. Banihashemi , Mahmoud Ahmadian-Attari