On tensor products of CSS Codes - Archive ouverte HAL Access content directly
Journal Articles Annales de l’Institut Henri Poincaré (D) Combinatorics, Physics and their Interactions Year : 2019

On tensor products of CSS Codes


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$.
Fichier principal
Vignette du fichier
Article_On tensor product of CSS codes.pdf (296.03 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01248760 , version 1 (19-01-2016)
hal-01248760 , version 2 (04-10-2018)



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



Gmail Mastodon Facebook X LinkedIn More