Live briefing
Everything about Sudoku code
Type of error correction code
Sudoku codes are non-linear forward error correcting codes following rules of sudoku puzzles designed for an erasure channel. Based on this model, the transmitter sends a sequence of all symbols of a solved sudoku. The receiver either receives a symbol correctly or an erasure symbol to indicate that the symbol was not received. The decoder gets a matrix with missing entries and uses the constraints of sudoku puzzles to reconstruct a limited amount of erased symbols. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Sudoku codeA 5-minute orientation
- Skim a recent paper: Symmetric Sudoku-Type Games From Perfect CodesInfluential work since 2022
- Pick up a classic book: NumPy CookbookThe most-reprinted book on the subject
- Read the landmark paper: Efficient QR code authentication mechanism based on SudokuCited 15 times
- Go sideways: Low-density parity-check codeA closely related topic
- Go sideways: Aztec CodeA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Efficient QR code authentication mechanism based on Sudoku
Sudoku-based secret sharing approach with cheater prevention using QR code
🆕 Influential since 2022
📚 Books worth reading
NumPy CookbookIvan Idris · 2012- 📕Christmas Activity BookBright Koala Books · 2022
Data structures using C++D. S. Malik · 2010
The Sudoku codeFrancis Heaney, Frank Longo · 2006- 📕Hard Sudoku CodeMasaki Hoshiko · 2019
- 📕240 Variety Puzzle Book 2; Word Search, Sudoku, Code Word and Word Fill-Ins for Effective Brain ExerciseJaja Jaja Media, J. Lubandi · 2020
- 📕240 Variety Puzzle Book 3; Word Search, Sudoku, Code Word and Word Fill-Ins for Effective Brain ExerciseJaja Jaja Media, J. Lubandi · 2020
- 📕240 Variety Puzzle Book 1Jaja Jaja Media, J. Lubandi · 2020
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Low-density parity-check code Low-density parity-check (LDPC) codes, also known as Gallager codes, are a class of error-correction codes first proposed in 1960. Together with the closely…
- Aztec Code The Aztec Code is a matrix code invented by Andrew Longacre, Jr. and Robert Hussey in 1995. The code was published by AIM, Inc. in 1997. Although the Aztec…
- Concatenated error correction code In coding theory, concatenated codes form a class of error-correcting codes that are derived by combining an inner code and an outer code. They were conceived…
- Zemor's decoding algorithm In coding theory, Zemor's algorithm, designed and developed by Gilles Zémor, is a recursive low-complexity approach to code construction. It is an improvement…
- Decoding methods In coding theory, decoding is the process of translating received messages into codewords of a given code. There have been many common methods of mapping…
- Noisy-channel coding theorem In information theory, the noisy-channel coding theorem (sometimes Shannon's theorem or Shannon's limit), establishes that for any given degree of noise…
- Variable-length encoding In coding theory, variable-length encoding is a symbol encoding scheme in which codes of differing lengths are used to encode symbols for representation…
- Standard array In coding theory, a standard array (or Slepian array) is a q n − k {\displaystyle q^{n-k}} by q k {\displaystyle q^{k}} array that lists all elements of…