completely regular codes distance (16 resultados)

hardcover. Condición: Fine.

Condición: New.

Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: New.

Condición: New. In.

Condición: New.

Hardcover. Condición: Brand New. 504 pages. 10.00x7.00x10.00 inches. In Stock.

Hardcover. Condición: new. Hardcover. The concept of completely regular codes was introduced by Delsarte in his celebrated 1973 thesis, which created the field of Algebraic Combinatorics. This notion was extended by several authors from classical codes over finite fields to codes in distance-regular graphs. Half a century later, there was no book dedicated uniquely to this notion. Most of Delsarte examples were in the Hamming and Johnson graphs. In recent years, many examples were constructed in other distance regular graphs including q-analogues of the previous, and the Doob graph.Completely Regular Codes in Distance Regular Graphs provides, for the first time, a definitive source for the main theoretical notions underpinning this fascinating area of study. It also supplies several useful surveys of constructions using coding theory, design theory and finite geometry in the various families of distance regular graphs of large diameters.FeaturesWritten by pioneering experts in the domainSuitable as a research reference at the masters levelIncludes extensive tables of completely regular codes in the Hamming graphFeatures a collection of up-to-date surveys This book provides, for the first time, a definitive source for the main theoretical notions underpinning this fascinating area of study. It also supplies several useful surveys of constructions using Coding Theory, Design Theory and Finite Geometry in the various families of distance regular graphs of large diameters. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Hardcover. Condición: new. Hardcover. The concept of completely regular codes was introduced by Delsarte in his celebrated 1973 thesis, which created the field of Algebraic Combinatorics. This notion was extended by several authors from classical codes over finite fields to codes in distance-regular graphs. Half a century later, there was no book dedicated uniquely to this notion. Most of Delsarte examples were in the Hamming and Johnson graphs. In recent years, many examples were constructed in other distance regular graphs including q-analogues of the previous, and the Doob graph.Completely Regular Codes in Distance Regular Graphs provides, for the first time, a definitive source for the main theoretical notions underpinning this fascinating area of study. It also supplies several useful surveys of constructions using coding theory, design theory and finite geometry in the various families of distance regular graphs of large diameters.FeaturesWritten by pioneering experts in the domainSuitable as a research reference at the masters levelIncludes extensive tables of completely regular codes in the Hamming graphFeatures a collection of up-to-date surveys This book provides, for the first time, a definitive source for the main theoretical notions underpinning this fascinating area of study. It also supplies several useful surveys of constructions using Coding Theory, Design Theory and Finite Geometry in the various families of distance regular graphs of large diameters. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Buch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The concept of completely regular codes was introduced by Delsarte in his celebrated 1973 thesis, which created the field of Algebraic Combinatorics. This notion was extended by several authors from classical codes over finite fields to codes in distance-regular graphs. Half a century later, there was no book dedicated uniquely to this notion. Most of Delsarte examples were in the Hamming and Johnson graphs. In recent years, many examples were constructed in other distance regular graphs including q-analogues of the previous, and the Doob graph.Completely Regular Codes in Distance Regular Graphs provides, for the first time, a definitive source for the main theoretical notions underpinning this fascinating area of study. It also supplies several useful surveys of constructions using coding theory, design theory and finite geometry in the various families of distance regular graphs of large diameters.FeaturesWritten by pioneering experts in the domainSuitable as a research reference at the master's levelIncludes extensive tables of completely regular codes in the Hamming graphFeatures a collection of up-to-date surveys 522 pp. Englisch.

HRD. Condición: New. New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.

Buch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The concept of completely regular codes was introduced by Delsarte in his celebrated 1973 thesis, which created the field of Algebraic Combinatorics. This notion was extended by several authors from classical codes over finite fields to codes in distance-regular graphs. Half a century later, there was no book dedicated uniquely to this notion. Most of Delsarte examples were in the Hamming and Johnson graphs. In recent years, many examples were constructed in other distance regular graphs including q-analogues of the previous, and the Doob graph.Completely Regular Codes in Distance Regular Graphs provides, for the first time, a definitive source for the main theoretical notions underpinning this fascinating area of study. It also supplies several useful surveys of constructions using coding theory, design theory and finite geometry in the various families of distance regular graphs of large diameters.FeaturesWritten by pioneering experts in the domainSuitable as a research reference at the master's levelIncludes extensive tables of completely regular codes in the Hamming graphFeatures a collection of up-to-date surveys.

Hardcover. Condición: new. Hardcover. The concept of completely regular codes was introduced by Delsarte in his celebrated 1973 thesis, which created the field of Algebraic Combinatorics. This notion was extended by several authors from classical codes over finite fields to codes in distance-regular graphs. Half a century later, there was no book dedicated uniquely to this notion. Most of Delsarte examples were in the Hamming and Johnson graphs. In recent years, many examples were constructed in other distance regular graphs including q-analogues of the previous, and the Doob graph.Completely Regular Codes in Distance Regular Graphs provides, for the first time, a definitive source for the main theoretical notions underpinning this fascinating area of study. It also supplies several useful surveys of constructions using coding theory, design theory and finite geometry in the various families of distance regular graphs of large diameters.FeaturesWritten by pioneering experts in the domainSuitable as a research reference at the masters levelIncludes extensive tables of completely regular codes in the Hamming graphFeatures a collection of up-to-date surveys This book provides, for the first time, a definitive source for the main theoretical notions underpinning this fascinating area of study. It also supplies several useful surveys of constructions using Coding Theory, Design Theory and Finite Geometry in the various families of distance regular graphs of large diameters. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.