# On tensor products of CSS Codes

2 GRACE - Geometry, arithmetic, algorithms, codes and encryption
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : CSS codes are in one-to-one correspondence with length 3 chain complexes. The latter are naturally endowed with a tensor product which induces a similar operation on the former. We investigate this operation, and in particular its behavior with regard to minimum distances. Given a CSS code $C$, we give a criterion which provides a lower bound on the minimum distance of $C \otimes D$ for every CSS code $D$. We apply this result to study the behaviour of iterated tensor powers of codes. Such sequences of codes are logarithmically LDPC and we prove in particular that their minimum distances tend generically to infinity. Different known results are reinterpretated in terms of tensor products. Three new families of CSS codes are defined, and their iterated tensor powers produce LDPC sequences of codes with length n, row weight in O(logn) and minimum distances larger than $n^{\alpha /2}$ for any $\alpha<1$. One family produces sequences with dimensions larger than $n^{\beta}$ for any $\beta<1$.
Keywords :
Document type :
Journal articles
Domain :

Cited literature [27 references]

https://hal.archives-ouvertes.fr/hal-01248760
Contributor : Benjamin Audoux Connect in order to contact the contributor
Submitted on : Thursday, October 4, 2018 - 4:17:21 PM
Last modification on : Wednesday, November 3, 2021 - 9:43:22 AM
Long-term archiving on: : Saturday, January 5, 2019 - 5:00:40 PM

### File

Article_On tensor product of C...
Files produced by the author(s)

### Citation

Benjamin Audoux, Alain Couvreur. On tensor products of CSS Codes. Annales de l’Institut Henri Poincaré (D) Combinatorics, Physics and their Interactions, European Mathematical Society, 2019, 6 (2), pp.239-287. ⟨10.4171/AIHPD/71⟩. ⟨hal-01248760v2⟩

### Metrics

Les métriques sont temporairement indisponibles