Refine your search

  • Books (2)

  • New (2)

to

Custom price range (US$)

to

Quantum Error Correcting Code (2 results)

Title: 
Refine with Advanced Search
  • Published by Science Press quantum error correcting code

    7030263839 / 9787030263834

    • Softcover

    Seller: liu xing, Nanjing, JS, Chinaliu xing

    5-star seller
    Contact seller

    Condition: New

    US$ 65.73

    US$ 18.00 shipping 
    Ships from China to U.S.A.

    Quantity: 3 available

    paperback. Condition: New. Language:Chinese.Paperback. Publisher: Science Press. In future quantum computation and quantum communication. quantum correction the wrong problem is more serious than the current problem of mathematical communication. And Steane 1995 PShor theoretical model of quantum error be simplified. so that quantum error correction see hope in 1998. Shor and Caldbank. who gives a strict number of quantum error correcting code.…

  • Language: English

    Published by Omniscriptum, 2026

    6132957375 / 9786132957375

    • Softcover
    • Print on Demand

    Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH

    5-star seller
    Contact seller

    Condition: New

    US$ 187.98

    US$ 39.21 shipping 
    Ships from Germany to U.S.A.

    Quantity: 1 available

    Taschenbuch. Condition: 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. Convolutionalcodes are used extensively in numerous applications in order to achievereliable data transfer, including digital video, radio, mobilecommunication, and satellite communication. These codes are oftenimplemented in concatenation with a hard-decision code, particularlyReed Solomon. Prior to turbo codes, such constructions were the mostefficient, coming closest to the Shannon limit.To convolutionally encodedata, start with k memory registers, each holding 1 input bit. Unlessotherwise specified, all memory registers start with a value of 0. Theencoder has n modulo-2 adders (a modulo 2 adder can be implemented witha single Boolean XOR gate, where the logic is: 0+0 = 0, 0+1 = 1, 1+0 =1, 1+1 = 0), and n generator polynomials - one for each adder (seefigure below). An input bit m1 is fed into the leftmost register. Usingthe generator polynomials and the existing values in the remainingregisters, the encoder outputs n bits.…