Enumerating and Decoding Perfect Linear Lee Codes

Publication Date

8-1-2009

Document Type

Article

Abstract

Using group theory approach, we determine all numbers q for which there exists a linear 1-error correcting perfect Lee code of block length n over Z q , and then we enumerate those codes. At the same time this approach allows us to design a linear time decoding algorithm.

Publication Title

Designs, Codes And Cryptography

Volume

52

Issue

2

First Page

155

Last Page

162

DOI

10.1007/s10623-009-9273-3

Publisher Policy

pre-print, post-print

This document is currently not available here.

Find in your library

Share

COinS