An investigation of SUDOKU-inspired non-linear codes with local constraints
Information Theory
2015-04-17 v2 math.IT
Abstract
Codes with local permutation constraints are described. Belief propagation decoding is shown to require the computation of permanents, and trellis-based methods for computing the permanents are introduced. New insights into the asymptotic performance of such codes are presented. A universal encoder for codes with local constraints is introduced, and simulation results for two code structures, SUDOKU and semi-pandiagonal Latin squares, are presented.
Keywords
Cite
@article{arxiv.1504.03946,
title = {An investigation of SUDOKU-inspired non-linear codes with local constraints},
author = {Jossy Sayir and Joned Sarwar},
journal= {arXiv preprint arXiv:1504.03946},
year = {2015}
}
Comments
Accepted for presentation at ISIT 2015