000			02299 a2200481 4500
001			1040309062
005			20250328151421.0
008			250324022025xx 22 eng
020			_a9781040309063 _qEA
037			_bTaylor & Francis _cGBP 165.00 _fBB
040			_a01
041			_aeng
072	7		_aPBV _2thema
072	7		_aGPJ _2thema
072	7		_aPBF _2thema
072	7		_aUY _2thema
072	7		_aUB _2thema
072	7		_aPBD _2thema
072	7		_aPBCD _2thema
072	7		_aPBH _2thema
072	7		_aPBV _2bic
072	7		_aGPJ _2bic
072	7		_aPBF _2bic
072	7		_aUY _2bic
072	7		_aUB _2bic
072	7		_aPBD _2bic
072	7		_aPBCD _2bic
072	7		_aPBH _2bic
072	7		_aMAT036000 _2bisac
072	7		_aMAT013000 _2bisac
072	7		_aMAT012010 _2bisac
072	7		_aCOM083000 _2bisac
072	7		_aMAT000000 _2bisac
072	7		_aMAT022000 _2bisac
072	7		_a511.5 _2bisac
100	1		_aMinjia Shi
245	1	0	_aCompletely Regular Codes in Distance Regular Graphs
250			_a1
260			_bChapman and Hall/CRC _c20250314
300			_a520 p
520			_bThe 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. Features Written by pioneering experts in the domain Suitable as a research reference at the master’s level Includes extensive tables of completely regular codes in the Hamming graph Features a collection of up-to-date surveys.
700	1		_aPatrick Solé _4B01
999			_c8153 _d8153