✦ LIBER ✦

Code Enumerators and Tutte Polynomials

✍ Scribed by Britz, T.

Book ID: 114642276
Publisher: IEEE
Year: 2010
Tongue: English
Weight: 206 KB
Volume: 56
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2010.2054654

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Extremal weight enumerators and ultrasph

Extremal weight enumerators and ultraspherical polynomials

✍ Iwan Duursma 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 210 KB

Interlace polynomials: Enumeration, unim

Interlace polynomials: Enumeration, unimodality and connections to codes

✍ Lars Eirik Danielsen; Matthew G. Parker 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 618 KB

Quasi-cyclic codes over and enumeration

Quasi-cyclic codes over and enumeration of defining polynomials

✍ Venkaiah, Vadlamudi Ch.; Gulliver, T. Aaron 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 169 KB

Ehrhart polynomial and arithmetic Tutte

Ehrhart polynomial and arithmetic Tutte polynomial

✍ Michele D’Adderio; Luca Moci 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 198 KB

Abelian avalanches and Tutte polynomials

✍ Andrei Gabrielov 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 997 KB

We introduce a class of deterministic lattice models of failure, Abelian avalanche (AA) models, with continuous phase variables, similar to discrete Abelian sandpile (ASP) models. We investigate analytically the structure of the phase space and statistical properties of avalanches in these models. W

Tutte polynomials for trees

✍ Sharad Chaudhary; Gary Gordon 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 682 KB

## Abstract We define two two‐variable polynomials for rooted trees and one two‐variable polynomial for unrooted trees, all of which are based on the coranknullity formulation of the Tutte polynomial of a graph or matroid. For the rooted polynomials, we show that the polynomial completely determine