In this paper we present a family of ternary quasi-perfect BCH codes. These codes are of minimum distance 5 and covering radius 3. The first member of this family is the ternary qu...
We give a space-efficient simple algorithm for computing the Lempel?Ziv factorization of a string. For a string of length n over an integer alphabet, it runs in O(n) time independ...
A simple replacement approach is used to construct new symmetric and affine designs from projective or affine spaces. This is used to construct symmetric designs with a given autom...
We present two families of constacyclic linear codes with large automorphism groups. The codes are obtained from the twisted tensor product construction. AMS subject classificatio...
This paper introduces a very low complexity visual masking algorithm for the JPEG2000 image compression standard and evaluates its impact on the visual image quality by means of t...