✦ LIBER ✦

Elementary differentials, their graphs and codes

✍ Scribed by A. V. Tygliyan; S. S. Filippov

Book ID: 111474545
Publisher: SP MAIK Nauka/Interperiodica
Year: 2010
Tongue: English
Weight: 182 KB
Volume: 2
Category: Article
ISSN: 2070-0482
DOI: 10.1134/s207004821002002x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Codes and designs from triangular graphs

Codes and designs from triangular graphs and their line graphs

✍ Washiela Fish; Khumbo Kumwenda; Eric Mwambene 📂 Article 📅 2011 🏛 SP Versita 🌐 English ⚖ 1010 KB

On graphs and codes

✍ R. T. Curtis 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 281 KB

In a recent paper we showed how the binary Golay code can be obtained in a revealing way straight from the edge-graph of the icosahedron. This construction not only yields a natural basis for the code, but also supplies a simple description of all codewords. In this paper we show that the above is m

An elementary treatise on differential e

An elementary treatise on differential equations and their applications

✍ Henry Thomas Herbert Piaggio 📂 Library 📅 2010 🏛 Nabu Press 🌐 English ⚖ 7 MB

Originally published in 1920. This volume from the Cornell University Library's print collections was scanned on an APT BookScan and converted to JPG 2000 format by Kirtas Technologies. All titles scanned cover to cover and pages may include marks notations and other marginalia present in the origin

Team tournaments and finite elementary c

Team tournaments and finite elementary codes

✍ G. Lallement; C. Reis 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 886 KB

Elementary number theory, cryptography a

Elementary number theory, cryptography and codes

✍ M. Welleda Baldoni, Ciro Ciliberto, G.M. Piacentini Cattaneo, Daniele Gewurz 📂 Library 📅 2008 🏛 Springer 🌐 English ⚖ 3 MB

In this volume one finds basic techniques from algebra and number theory (e.g. congruences, unique factorization domains, finite fields, quadratic residues, primality tests, continued fractions, etc.) which in recent years have proven to be extremely useful for applications to cryptography and codin

Elementary Bipartite Graphs and Unique C

Elementary Bipartite Graphs and Unique Colourability

✍ Gábor Bacsó 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 44 KB

The Clique-Pair-Conjecture (CPC) states that a uniquely colourable perfect graph, different from a clique, contains two maximum size cliques having a two element symmetric difference. One can make an auxiliary graph B from a minimal counterexample for the CPC (if any exists), this B is bipartite. We