Proof of theorem 1[edit]

To prove theorem 1 we will construct a decoding algorithm and prove its correctness.
Algorithm[edit]

Input: Received word

For each :

1. Pick uniformly at random.

2. Pick such that , where is the -th standard basis vector and

is the bitwise xor of and .

3. .

Output: Message
Proof of correctness[edit]

For any message, , and received word such that differs from on at most

fraction of bits, can be decoded with probability at least .

By lemma 1, . Since and are picked uniformly, the probability that is at

most . Similarly, the probability that is at most . By the union bound, the probability

that either or do not match the corresponding bits in is at most . If both

and correspond to , then lemma 1 will apply, and therefore, the proper value of

will be computed. Therefore, the probability is decoded properly is at least . There-

fore, and for to be positive, .

Therefore, the Walsh–Hadamard code is locally decodable for .

Optimality[edit]
For k ≤ 7 the linear Hadamard codes have been proven optimal in the sense of minimum distance. [7]

See also[edit]
 Zadoff–Chu sequence — improve over the Walsh–Hadamard codes
References[edit]
1. ^ Malek, Massoud (2006). "Hadarmark Codes". Coding Theory (PDF). Archived from the original (PDF) on 2020-01-09.
2. ^ Amadei, M.; Manzoli, Umberto; Merani, Maria Luisa (2002-11-17). "On the assignment of Walsh and quasi-orthogonal codes in a
multicarrier DS-CDMA system with multiple classes of users". Global Telecommunications Conference, 2002. GLOBECOM'02. IEEE.
Vol. 1. IEEE. pp. 841–845. doi:10.1109/GLOCOM.2002.1188196. ISBN 0-7803-7632-3.
3. ^ Arora, Sanjeev; Barak, Boaz (2009). "Section 19.2.2". Computational Complexity: A Modern Approach. Cambridge University
Press. ISBN 978-0-521-42426-4.
4. ^ Guruswami, Venkatesan (2009). List decoding of binary codes (PDF). p. 3.
 5. ^ Bose, Raj Chandra; Shrikhande, Sharadchandra Shankar (June 1959). "A note on a result in the theory of code construction". Infor-
mation and Control. 2 (2): 183–194. CiteSeerX 10.1.1.154.2879. doi:10.1016/S0019-9958(59)90376-6.
6. ^ Langton, Charan [at Wikidata] (2002). "CDMA Tutorial: Intuitive Guide to Principles of Communications" (PDF). Complex to
Real. Archived (PDF) from the original on 2011-07-20. Retrieved 2017-11-10.
7. ^ Jaffe, David B.; Bouyukliev, Iliya. "Optimal binary linear codes of dimension at most seven". Archived from the original on 2007-08-
08. Retrieved 2007-08-21.

Further reading[edit]
 Rudra, Atri. "Hamming code and Hamming bound" (PDF). Lecture notes.
 Rudolph, Dietmar; Rudolph, Matthias (2011-04-12). "46.4. Hadamard– oder Walsh–Codes". Modulationsver-
fahren (PDF) (in German). Cottbus, Germany: Brandenburg University of Technology (BTU).
p. 214. Archived (PDF) from the original on 2021-06-16. Retrieved 2021-06-14. (xiv+225 pages)

hide

 v

 t

 e

Consultative Committee for Space Data Systems

Images

ICER

JPEG

Data compression JPEG 2000

122.0.B1

Data

Adaptive Entropy Coder

Current

Binary Golay code

Concatenated codes
Error Correction
Turbo codes

Proposed

LDPC codes

Command Loss Timer Reset

Telemetry command uplink
Proximity-1 Space Link Protocol

Spacecraft Monitoring & Control

Telemetry downlink
Beacon mode service

Telemetry general Space Communications Protocol Specifications (SCPS): Performance Enhancing Proxy

Current

BPSK

QPSK
Telemetry modulation systems
OQPSK

Proposed

GMSK
 X band

S band

Frequencies Ku band

K band

Ka band

Networking, interoperability and

Service-oriented architecture (Message Abstraction Layer)
monitoring
Categories:
 Coding theory
 Error detection and correction
 This page was last edited on 28 August 2023, at 15:43 (UTC).
 Text is available under the Creative Commons Attribution-ShareAlike License 4.0; additional terms may apply. By using this site, you agree to the Terms of
Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a non-profit organization.