Online media content distributions require methods to protect the intellectual property of distributed content. Intellectual property protection measures preserves the ownership rights of original work so that no one can plagiarize the work in any way without seeking permission for the use and, if necessary, paying a royalty for the usage. Digital watermarking is one such technology in electron...

A strategy for computing upper code-length limits of AC Huffman codes for an 8x8 block in JPEG Baseline coding is developed. The method is based on a geometric interpretation of the DCT, and the calculated limits are as close as 14% to the maximum code-lengths. The proposed strategy can be adapted to other transform coding methods, e.g., MPEG 2 and 4 video compressions, to calculate close upper...

With the knowledge of the syndromes Sa,b, 0 ≤ a, b ≤ q − 2, the exact error values cannot be determined by using the conventional (q − 1)2-point discrete Fourier transform in the decoding of a plane algebraic-geometric code over GF (q). In this letter, the inverse q-point 1-dimensional and q2-point 2dimensional affine Fourier transform over GF (q) are presented to be used to retrieve the actual...

We use a geometric approach to solve an extremal problem in coding theory. Expressed in geometric language we show the nonexistence of a system of 12 lines in PG(8, 2) with the property that no hyperplane contains more than 5 of the lines. In coding-theoretic terms this is equivalent with the non-existence of an additive quaternary code of length 12, binary dimension 9 and minimum distance 7.

Visual code markers are developed as a humanmachine interactive tool [1] [2]. In this class project, a code recognition program is developed to read code markers. The requirements of the code recognition program are high accuracy, speed and illumination insensitivity. There can be more than one visual code in the picture and the orientations of the visual codes are not restricted. The code mark...

The stabilizer code is the most general algebraic construction of quantum error-correcting codes proposed so far. A stabilizer code can be constructed from a self-orthogonal subspace of a symplectic space over a finite field. We propose a construction method of such a selforthogonal space using an algebraic curve. By using the proposed method we construct an asymptotically good sequence of bina...

Reed-Solomon and BCH codes were considered as kernels of polar codes by Mori and Tanaka in [6] and Korada, Şaşoğlu, and Urbanke in [4] to create polar codes with large exponents. For codes of length l ≤ q, Mori and Tanaka showed Reed-Solomon codes give the best possible exponent, where q is the size of the input alphabet. However, considering larger matrices over Fq yields better exponents for ...

We present iterative decoding process of Geometric Augmented Product codes that is a newly proposed linear block code construction technique. We also report the bit error performances for one of the constructed code of the technique utilising our iterative decoding approach.

An implementation of both finite rate and equilibrium chemistry have been completed for the OVERFLOW code, a chimera capable, complex geometry flow code widely used to predict transonic flowfields. The implementation builds on the computational efficiency and geometric generality of the solver.

We present a general purpose code analyzer/generator for filtered predicates, which are critical for geometric algorithms. While there already exist such code generators, our contribution is to generate ”almost static filters”, a type of filter which could not be generated previously. The generated and safe filtered predicates are almost as fast as their inexact floating point counterparts, in ...