On Poincaré series for codes

DOI10.1007/BF02362522MaRDI QIDQ1126542zbMATH OpenOpenAlexFDO

Authors V. E. Govorov

Publication date 10 December 1996

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02362522

zbMATH Keywords

alphabet codinghomology groupPoincaré series

Mathematics Subject Classification ID

Homological methods in associative algebras (16E99) Prefix, length-variable, comma-free codes (94A45)

Review text

In the model of alphabet coding the author considers several classes of codes (prefix, comma-free, overlapping-free, etc.). The main objects under consideration are the associative algebra \(R\) over a field \(k\) whose ideal of defining relations is generated by the codewords, the homology groups \(H_n(R,k)\), and the Poincaré series \(T(H_n)\) and \(T(R)\). The goal is to express some properties of codes in terms of the Poincaré series. An alternative approach consists in considering the incidence matrices of some graphs corresponding to the code.

Recommendations

• scientific article; zbMATH DE number 3895249
• The Poincaré polynomial of a linear code
• A general theory of codes, II: Paradigms and homomorphisms
• scientific article; zbMATH DE number 3943051
• scientific article; zbMATH DE number 3985118

Cited in

(1)

• scientific article; zbMATH DE number 3895249 (Why is no real title available?)

This page was built for publication: On Poincaré series for codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126542)