Error correcting code using tree-like multilayer perceptron

Abstract

An error correcting code using a tree-like multilayer perceptron is proposed. An original message $\mbi{s}^0$ is encoded into a codeword $\boldmath{y}_0$ using a tree-like committee machine (committee tree) or a tree-like parity machine (parity tree). Based on these architectures, several schemes featuring monotonic or non-monotonic units are introduced. The codeword $\mbi{y}_0$ is then transmitted via a Binary Asymmetric Channel (BAC) where it is corrupted by noise. The analytical performance of these schemes is investigated using the replica method of statistical mechanics. Under some specific conditions, some of the proposed schemes are shown to saturate the Shannon bound at the infinite codeword length limit. The influence of the monotonicity of the units on the performance is also discussed.

23 pages, 3 figures, Content has been extended and revised

References in corpus (8)

• Thouless-Anderson-Palmer Approach for Lossy Compression
• Density Evolution for Asymmetric Memoryless Channels
• Statistical mechanics of lossy data compression using a non-monotonic perceptron
• Gallager error correcting codes for binary asymmetric channels
• One step RSB scheme for the rate distortion function
• Statistical mechanics of lossy compression using multilayer perceptrons
• Statistical Mechanical Approach to Lossy Data Compression:Theory and Practice
• Statistical mechanics of lossy compression for non-monotonic multilayer perceptrons