Abstract
An algorithm is derived for inferring a binary vector s given noisy observations of As modulo 2, where A is a binary matrix. The binary vector is replaced by a vector of probabilities, optimised by free energy minimisation. Experiments on the inference of the state of a linear feedback shift register indicate that this algorithm supersedes the Meier and Staffelbach polynomial algorithm.
Keywords
Minimisation (clinical trials)Decoding methodsBinary numberAlgorithmModuloCryptanalysisMathematicsComputer scienceDiscrete mathematicsCryptographyArithmeticStatistics
Affiliated Institutions
Related Publications
The art of signaling: fifty years of coding theory
In 1948 Shannon developed fundamental limits on the efficiency of communication over noisy channels. The coding theorem asserts that there are block codes with code rates arbitr...
Publication Info
- Year
- 1995
- Type
- article
- Volume
- 31
- Issue
- 6
- Pages
- 446-447
- Citations
- 79
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
79
OpenAlex
Cite This
David Mackay
(1995).
Free energy minimisation algorithmfor decoding and cryptanalysis.
Electronics Letters
, 31
(6)
, 446-447.
https://doi.org/10.1049/el:19950331
Identifiers
- DOI
- 10.1049/el:19950331