Generating functions of circular codes (Q1277204)

From MaRDI portal
Revision as of 17:19, 28 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Generating functions of circular codes
scientific article

    Statements

    Generating functions of circular codes (English)
    0 references
    11 April 1999
    0 references
    The author studies the generating series of the star of a circular code. Among her results, we quote a characterization of the length distributions of circular codes in the case of a weighted alphabet. In particular it is possible to decide whether a finite sequence is the length distribution of a circular code. Circular codes seem to be used in the analysis of DNA sequences, and the author quotes a paper of \textit{D. Arguès} and \textit{C. Michel} [A possible code in the genetic code, in ``STACS 95'', Lect. Notes Comput. Sci. 800, 640-651 (1995; Zbl 0909.92013)]. A few minor misprints occur in the paper (``coma'' instead of ``comma'' on page 1, a strange upper bound for an index of summation on page 8, ``due'' instead of ``du'' in Reference [Kro 87] \dots).
    0 references
    codes with bounded synchronization delay
    0 references
    length distributions of circular codes
    0 references
    weighted alphabet
    0 references

    Identifiers