English
Related papers

Related papers: On some batch code properties of the simplex code

200 papers

We prove an elementary additive combinatorics inequality, which says that if $A$ is a subset of an Abelian group, which has, in some strong sense, large doubling, then the difference set A-A has a large subset, which has small doubling.

Combinatorics · Mathematics 2011-07-26 Misha Rudnev

Boolean functions can be used to construct binary linear codes in many ways, and vice versa. The objective of this short article is to point out a connection between the weight distributions of all projective binary linear codes and the…

Information Theory · Computer Science 2020-10-12 Cunsheng Ding

We describe an algorithm, which - given the characters of tilting modules and assuming that Donkin's tilting conjecture is true - computes the characters of simple modules for an algebraic group in any characteristic.

Representation Theory · Mathematics 2017-09-11 Tobias Kildetoft

Binary matrix codes with restricted row and column weights are a desirable method of coded modulation for power line communication. In this work, we construct such matrix codes that are obtained as products of affine codes - cosets of…

Information Theory · Computer Science 2015-06-12 Yeow Meng Chee , Han Mao Kiah , Punarbasu Purkayastha , Patrick Solé

We discuss quantum two-block codes, a large class of CSS codes constructed from two commuting square matrices.Interesting families of such codes are generalized-bicycle (GB) codes and two-block group-algebra (2BGA) codes, where a cyclic…

Quantum Physics · Physics 2023-08-01 Renyu Wang , Hsiang-Ku Lin , Leonid P. Pryadko

A unital $\ell$-group $(G,u)$ is an abelian group $G$ equipped with a translation-invariant lattice-order and a distinguished element $u$, called order-unit, whose positive integer multiples eventually dominate each element of $G$. We…

Group Theory · Mathematics 2009-08-18 Manuela Busaniche , Leonardo Cabrer , Daniele Mundici

We give a few properties equivalent to the Bloch-Kato conjecture (now the norm residue isomorphism theorem).

Algebraic Geometry · Mathematics 2019-02-14 Bruno Kahn

Motivated by applications in reliable and secure communication, we address the problem of tiling (or partitioning) a finite constellation in $\mathbb{Z}_{2^L}^n$ by subsets, in the case that the constellation does not possess an abelian…

Information Theory · Computer Science 2021-05-13 Maiara F. Bollauf , Øyvind Ytrehus

The computation of two Bayesian predictive distributions which are discrete mixtures of incomplete beta functions is considered. The number of iterations can easily become large for these distributions and thus, the accuracy of the result…

Statistics Theory · Mathematics 2007-06-13 Jacques Poitevineau , Bruno Lecoutre

A $k$-modal sequence is a sequence of real numbers that can be partitioned into $k+1$ (possibly empty) monotone sections such that adjacent sections have opposite monotonicities. For every positive integer $k$, we prove that any sequence of…

Combinatorics · Mathematics 2024-03-21 Zijian Xu

The main goal of this paper is to apply the arithmetic method developed in our previous paper \cite{13} to determine the number of some types of subgroups of finite abelian groups.

Group Theory · Mathematics 2018-06-01 Marius Tărnăuceanu

We discuss two properties of an abelian variety, namely, being a direct summand in a product of Jacobians and the weaker property of being "split". We relate the first property to the integral Hodge conjecture for curve classes on abelian…

Algebraic Geometry · Mathematics 2023-07-07 Claire Voisin

In this note some properties of the sum of element orders of a finite abelian group are studied.

Group Theory · Mathematics 2018-05-31 Marius Tărnăuceanu , Dan Gregorian Fodor

For a finite group $G$ and for a fixed positive integer $k$, $k\geq 2$, the $k$-power graph of $G$ is an undirected simple graph with vertex set $G$ in which two distinct vertices $x$ and $y$ are adjacent if and only if $x^k=y$ or $y^k=x$.…

Group Theory · Mathematics 2023-01-26 Swathi V , M S Sunitha

Linear codes with a few weights have many nice applications including combinatorial design, distributed storage system, secret sharing schemes and so on. In this paper, we construct two families of linear codes with a few weights based on…

Information Theory · Computer Science 2022-10-12 Ziling Heng , Xinran Wang , Xiaoru Li

Additive cyclic codes over Galois rings were investigated in previous works. In this paper, we investigate the same problem but over a more general ring family, finite commutative chain rings. When we focus on non-Galois finite commutative…

Information Theory · Computer Science 2017-01-25 Edgar Martínez-Moro , Kamil Otal , Ferruh Özbudak

In an application, where a client wants to obtain many elements from a large database, it is often desirable to have some load balancing. Batch codes (introduced by Ishai et al. in STOC 2004) make it possible to do exactly that: the large…

Information Theory · Computer Science 2014-04-11 Helger Lipmaa , Vitaly Skachek

Using a ``3 by 3 matrix trick'' we previously showed that multiplication in a C*-algebra A, an algebraic structure, is determined by the geometry of the C*-algebra of the 3 by 3 matrices with entries from A. As an application of this…

Operator Algebras · Mathematics 2007-05-23 Robert A. Cohen , Martin E. Walter

If $E$ is a Banach space, any element $x^{**}$ in its bidual $E^{**}$ is an affine function on the dual unit ball $B_{E^*}$ that might possess variety of descriptive properties with respect to the weak* topology. We prove several results…

Functional Analysis · Mathematics 2011-05-18 Pavel Ludvik , Jiri Spurny

We verify a finiteness conjecture of Feit on sources of simple modules over group algebras for various classes of finite groups related to the symmetric groups.

Representation Theory · Mathematics 2011-12-21 Susanne Danz , Jürgen Müller