Learn More
It has been known that the code lengths of Tardos's collusion-secure fingerprinting codes are of theoretically minimal order with respect to the number of adversarial users (pirates). However, the code lengths can be further reduced, as some preceding studies on Tardos's codes already revealed. In this article we improve a recent discrete variant of(More)
We investigate candidates of finite random variables for c-secure random fingerprinting codes, in viewpoints of both code lengths and required memories. We determine, under a natural assumption, the random variables with the minimal number of outputs (i.e. optimal in a viewpoint of memory) among all candidates, by revealing their deep relation with theory(More)
A set of linearly constrained permutation matrices are proposed for constructing a class of permutation codes. The main feature of this class of permutation codes, called linear programming (LP)-decodable permutation codes, is this LP decodability. It is demonstrated that the LP decoding performance of the proposed class of permutation codes is(More)
Differential measurements of elliptic flow (v2) for Au+Au and Cu+Cu collisions at sqrt[sNN]=200 GeV are used to test and validate predictions from perfect fluid hydrodynamics for scaling of v2 with eccentricity, system size, and transverse kinetic energy (KE T). For KE T identical with mT-m up to approximately 1 GeV the scaling is compatible with(More)
For designing low-density parity-check (LDPC) codes for quantum error-correction, we desire to satisfy the conflicting requirements below simultaneously. 1) The row weights of parity-check “should be large”: The minimum distances are bounded above by the minimum row weights of parity-check matrices of constituent classical codes. Small minimum(More)
In this paper, we consider quantum error correction over depolarizing channels with nonbinary low-density parity-check codes defined over Galois field of size 2<sup>p</sup>. The proposed quantum error correcting codes are based on the binary quasi-cyclic Calderbank, Shor, and Steane (CSS) codes. The resulting quantum codes outperform the best known quantum(More)