Existence of perfect Mendelsohn designs with k=5 and λ>1

AbstractLet υ, k, and λ be positive integers. A (υ, k, λ)-Mendelsohn design (briefly (υ, k, λ)-MD) is a pair (X, B) where X is a υ-set (of points) and B is a collection of cyclically ordered k-subsets of X (called blocks) such that every ordered pair of points of X are consecutive in exactly λ blocks of B. A set of k distinct elements {a1, a2,…, ak} is said to be cyclically ordered by a1<a2<⋯<ak<a1 and the pair ai, ai+t is said to be t-apart in cyclic k-tuple (a1, a2,…, ak) where i+t is taken modulo k. It for all t=1,2,…, k-1, every ordered pair of points of X is t-apart in exactly λ blocks of B, then the (υ, k, λ)-MD is called a perfect design and is denoted briefly by (υ, k, λ)-PMD. In this paper, we shall be concerned mainly with the case where k=5 and λ>1. It will be shown that the necessary condition for the existence of a (υ, 5, λ)-PMD, namely, λv(υ-1)≡0 (mod 5), is also sufficient for λ>1 with the possible exception of pairs (υ, λ) where λ=5 and υ=18 and 28

High-Rate Quantum Low-Density Parity-Check Codes Assisted by Reliable Qubits

Quantum error correction is an important building block for reliable quantum information processing. A challenging hurdle in the theory of quantum error correction is that it is significantly more difficult to design error-correcting codes with desirable properties for quantum information processing than for traditional digital communications and computation. A typical obstacle to constructing a variety of strong quantum error-correcting codes is the complicated restrictions imposed on the structure of a code. Recently, promising solutions to this problem have been proposed in quantum information science, where in principle any binary linear code can be turned into a quantum error-correcting code by assuming a small number of reliable quantum bits. This paper studies how best to take advantage of these latest ideas to construct desirable quantum error-correcting codes of very high information rate. Our methods exploit structured high-rate low-density parity-check codes available in the classical domain and provide quantum analogues that inherit their characteristic low decoding complexity and high error correction performance even at moderate code lengths. Our approach to designing high-rate quantum error-correcting codes also allows for making direct use of other major syndrome decoding methods for linear codes, making it possible to deal with a situation where promising quantum analogues of low-density parity-check codes are difficult to find