Hamming bound computer science (1 risultati)

Titolo: 
Perfeziona con la Ricerca avanzata

Perfeziona la tua ricerca

  • Libri (1)

  • Nuovo (1)

  • Con foto (1)

a

Fascia di prezzo personalizzata (EUR)

a

  • Lingua: Inglese

    Editore: Omniscriptum, 2026

    6133001623 / 9786133001626

    • Brossura
    • Print on Demand

    Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 222,50

    EUR 35,00 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 1 disponibile

    Taschenbuch. Condizione: 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.…