We investigate css and css-t quantum error-correcting codes from the point of view of their existence, rarity, and performance. We give a lower bound on the number of pairs of linear codes that give rise to a csscode...
详细信息
We investigate css and css-t quantum error-correcting codes from the point of view of their existence, rarity, and performance. We give a lower bound on the number of pairs of linear codes that give rise to a csscode with good correction capability, showing that such pairs are easy to produce with a randomized construction. We then prove thatcss-t codes exhibitthe opposite behaviour, showing also that, under very natural assumptions, their rate and relative distance cannot be simultaneously large. this partially answers an open question on the feasible parameters of css-t codes. We conclude with a simple construction of css-t codes from Hermitian curves. the paper also offers a concise introduction to css and css-t codes from the point of view of classical coding theory.
暂无评论