English
Related papers

Related papers: A note on the Assmus--Mattson theorem for some bin…

200 papers

We clarify the mathematical structure underlying unitary $t$-designs. These are sets of unitary matrices, evenly distributed in the sense that the average of any $t$-th order polynomial over the design equals the average over the entire…

Quantum Physics · Physics 2009-11-13 D. Gross , K. Audenaert , J. Eisert

The at-most-k constraint is ubiquitous in combinatorial problems, and numerous SAT encodings are available for the constraint. Prior experiments have shown the competitiveness of the sequential-counter encoding for k $>$ 1, and have…

Logic in Computer Science · Computer Science 2020-05-14 Neng-Fa Zhou

The hull $H(C)$ of a linear code $C$ is defined by $H(C)=C \cap C^\perp$. A linear code with a complementary dual (LCD) is a linear code with $H(C)=\{0\}$. The dimension of the hull of a code is an invariant under permutation equivalence.…

Information Theory · Computer Science 2018-09-17 Ruud Pellikaan

For a simple module $M$ over the positive part of the Virasoro algebra (actually for any simple module over some finite dimensional solvable Lie algebras $\mathfrak{a}_r$) and any $\alpha\in\C$, a class of weight modules $\mathcal {N}(M,…

Representation Theory · Mathematics 2019-08-08 Genqiang Liu , Rencai Lu , Kaiming Zhao

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…

Information Theory · Computer Science 2015-03-13 Mingzhi Zhu , Gennian Ge

Let $n \geq 3$ and $R_{abcd}$ be a $(4,0)$ sectionally positive curvature-type tensor (a tensor possessing all the local symmetries of the $(4,0)$ curvature tensor). Then there exists a metric tensor $g_{ab}$ such that $R_{abcd}\; g^{bd} =…

Differential Geometry · Mathematics 2020-06-03 Dan Gregorian Fodor

Linear codes with a few weights have important applications in authentication codes, secret sharing, consumer electronics, etc.. The determination of the parameters such as Hamming weight distributions and complete weight enumerators of…

Information Theory · Computer Science 2017-11-15 Minglong Qi , Shengwu Xiong , Jingling Yuan , Wenbi Rao , Luo Zhong

Motivated by applications in polymer-based data storage we introduced the new problem of characterizing the code rate and designing constant-weight binary $B_2$-sequences. Binary $B_2$-sequences are collections of binary strings of length…

Information Theory · Computer Science 2023-03-24 Jin Sima , Yun-Han Li , Ilan Shomorony , Olgica Milenkovic

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…

Combinatorics · Mathematics 2014-01-21 Yeow Meng Chee , Fei Gao , Han Mao Kiah , Alan Chi Hung Ling , Hui Zhang , Xiande Zhang

It is known that there is a close analogy between "Euclidean t-designs vs. spherical t-designs" and "Relative t-designs in binary Hamming association schemes vs. combinatorial t-designs". In this paper, we want to prove how much we can…

Combinatorics · Mathematics 2013-04-23 Eiichi Bannai , Etsuko Bannai , Hideo Bannai

This article reviews and studies the properties of Bayesian quadrature weights, which strongly affect stability and robustness of the quadrature rule. Specifically, we investigate conditions that are needed to guarantee that the weights are…

Statistics Theory · Mathematics 2019-08-05 Toni Karvonen , Motonobu Kanagawa , Simo Särkkä

A sufficient condition for the two-weight boundedness of higher order commutators was recently obtained by Holmes and Wick in terms of an intersection of two BMO spaces. We provide an alternative proof, showing that the higher order case…

Classical Analysis and ODEs · Mathematics 2016-04-11 Tuomas P. Hytönen

We propose new results on low weight codewords of affine and projective generalized Reed-Muller codes. In the affine case we prove that if the size of the working finite field is large compared to the degree of the code, the low weight…

Information Theory · Computer Science 2013-04-09 Stéphane Ballet , Robert Rolland

We investigate the weight distribution of random binary linear codes. For $0<\lambda<1$ and $n\to\infty$ pick uniformly at random $\lambda n$ vectors in $\mathbb{F}_2^n$ and let $C \le \mathbb{F}_2^n$ be the orthogonal complement of their…

Information Theory · Computer Science 2024-07-11 Nati Linial , Jonathan Mosheiff

Tsfasman-Boguslavsky Conjecture predicts the maximum number of zeros that a system of linearly independent homogeneous polynomials of the same positive degree with coefficients in a finite field can have in the corresponding projective…

Algebraic Geometry · Mathematics 2018-01-30 Mrinmoy Datta , Sudhir R. Ghorpade

We express the weight enumerators of self-dual and doubly even (Type II for short) codes of length $24$ with a specified basis. As a consequence, we present some congruence relations among the weight enumerators.

Combinatorics · Mathematics 2023-03-15 Shoyu Nagaoka , Manabu Oura

We prove positive mass theorem with angular momentum and charges for axially symmetric, simply connected, maximal, complete initial data sets with two ends, one designated asymptotically flat and the other either (Kaluza-Klein)…

Differential Geometry · Mathematics 2020-02-13 Aghil Alaee , Shing-Tung Yau

The c-map of four dimensional non-linear theories of electromagnetism is considered both in the rigid case and in its coupling to gravity. In this way theories with antisymmetric tensors and scalars are obtained, and the three non-linear…

High Energy Physics - Theory · Physics 2016-06-22 Laura Andrianopoli , Riccardo D'Auria , Sergio Ferrara , Mario Trigiante

There are exactly two non-commutative rings of size $4$, namely, $E = \langle a, b ~\vert ~ 2a = 2b = 0, a^2 = a, b^2 = b, ab= a, ba = b\rangle$ and its opposite ring $F$. These rings are non-unital. A subset $D$ of $E^m$ is defined with…

Information Theory · Computer Science 2023-09-20 Vidya Sagar , Ritumoni Sarma

We consider the large-N limit of \mathcal{N}=6 U(N) \times U(N) superconformal Chern-Simons (ABJM) theory with fixed level k, which is conjectured to be dual to M-theory on AdS4\times (S^7/Z_k) background. We point out that the so-called…

High Energy Physics - Theory · Physics 2015-05-30 Masanori Hanada , Carlos Hoyos , Hidehiko Shimada
‹ Prev 1 8 9 10 Next ›