- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications (all current information on this profile has been aggregated automatically from

**publisher and metadata sources**).Linear tail-biting trellises for block codes are considered. By introducing the notions of subtrellis, merging interval, and sub-tail-biting trellis, some structural properties of linear tail-biting… Continue Reading

1 July 1998

In this correspondence, the trellis representation of the Kerdock and Delsarte-Goethals codes is addressed. It is shown that the states of a trellis representation of DG(m,/spl delta/) under any… Continue Reading

The trellis complexity of the Preparata and Goethals codes is examined. It is shown that at least for a given set of permutations these codes are rectangular. Upper bounds on the state complexity… Continue Reading

In this note, it is shown that if $f\colon\efq^n\to\efq^n$ is any function and $\bA=(A_1,..., A_n)$ is uniformly distributed over $\efq^n$, then the average over $(k_1,...,k_n)\in \efq^n$ of the… Continue Reading

1 April 2004

Nonlinear Xing codes are considered. It is shown that Xing codes of length p-1 (where p is a prime) are subcodes of cosets of Reed-Solomon codes whose minimum distance equals Xing's lower bound on… Continue Reading

1 March 2004

Lower bounds on the state complexity of linear tail-biting trellises are presented. One bound generalizes the total-span bound, while another bound can be regarded as a generalization of the cut-set… Continue Reading

Un procede de communication consiste a generer un ou plusieurs flux de donnees, qui seront transmis a des recepteurs cibles respectifs (28), et un ou plusieurs flux de brouillage. Au moins un… Continue Reading

We consider asymptotically good nonlinear codes recently introduced by Xing (2003). The original definition of these codes relies on a nonconstructive averaging argument. In this paper, it is first… Continue Reading

An upper bound on the minimal state complexity of codes from the Hermitian function field and some of its subfields is derived. Coordinate orderings under which the state complexity of the codes is… Continue Reading