Minjia shi (23 Ergebnisse)

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Zustand: New.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Zustand: New.

Zustand: As New. Unread book in perfect condition.

Zustand: New. In English.

Hardback. Zustand: New. There are connections between invariant theory and modular forms since the times of Felix Klein, in the 19th century, connections between codes and lattices since the 1960's. The aim of the book is to explore the interplay between codes and modular forms. Here modular form is understood in a wide sense (Jacobi forms, Siegel forms, Hilbert forms). Codes comprises not only linear spaces over finite fields but modules over some commutative rings. The connection between codes over finite fields and lattices has been well documented since the 1970s. Due to an avalanche of results on codes over rings since the 1990's there is a need for an update at book level.…

Hardcover. Zustand: Brand New. 217 pages. 9.25x6.25x0.75 inches. In Stock.

Zustand: New.

hardcover. Zustand: Fine.

Taschenbuch. Zustand: Neu. Codes and Rings | Theory and Practice Volume - | Minjia Shi (u. a.) | Taschenbuch | Englisch | 2017 | Elsevier Science | EAN 9780128133880 | Verantwortliche Person für die EU: Elsevier B.V., Radarweg 29, 1043 NX AMSTERDAM, NIEDERLANDE, productsafety[at]elsevier[dot]com | Anbieter: preigu.…

Hardback. Zustand: New. There are connections between invariant theory and modular forms since the times of Felix Klein, in the 19th century, connections between codes and lattices since the 1960's. The aim of the book is to explore the interplay between codes and modular forms. Here modular form is understood in a wide sense (Jacobi forms, Siegel forms, Hilbert forms). Codes comprises not only linear spaces over finite fields but modules over some commutative rings. The connection between codes over finite fields and lattices has been well documented since the 1970s. Due to an avalanche of results on codes over rings since the 1990's there is a need for an update at book level.…

hardcover. Zustand: New. Brand new book, sourced directly from publisher. Dispatch time is 7-8 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Zustand: New.

Paperback. Zustand: Brand New. 301 pages. 9.00x5.75x0.75 inches. In Stock.

Zustand: As New. Unread book in perfect condition.

Zustand: New.

Zustand: New.

Zustand: New.

Zustand: New. In English.

Hardback. Zustand: New. 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. Zustand: Brand New. 504 pages. 10.00x7.00x10.00 inches. In Stock.

Hardback. Zustand: New. 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.…