Griesmer bound coding theory (2 résultats)

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In themathematics of coding theory, the Griesmer bound is a bound on thelength of binary codes of dimension k and minimum distance d. There isalso a very similar version for non-binary codes. Coding theory is thestudy of the properties of codes and their fitness for a specificapplication. Codes are used for data compression, cryptographyerror-correction and more recently also for network coding. Codes arestudied by various scientific disciplines-such as information theoryelectrical engineering, mathematics, and computer science-for thepurpose of designing efficient and reliable data transmission methods.This typically involves the removal of redundancy and the correction (ordetection) of errors in the transmitted data.…

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In mathematicsand computer science, in the field of coding theory, the Hamming boundis a limit on the parameters of an arbitrary block code: it is alsoknown as the sphere-packing bound or the volume bound from aninterpretation in terms of packing balls in the Hamming metric into thespace of all possible words. It gives an important limitation on theefficiency with which any error correcting code can utilize the space inwhich its code words are embedded. A code which attains the Hammingbound is said to be a perfect code.…