Binary codes from rectangular lattice graphs and permutation decoding
type: Item
instance of: scholarly article
title: Binary codes from rectangular lattice graphs and permutation decoding
zbMATH Open document ID: 1105.94018
published in: European Journal of Combinatorics
publication date: 2006-12-07T00:00:00Z
Mathematics Subject Classification ID: 94B25
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 94B35
zbMATH DE Number: 5077692
zbMATH Keywords: explicit information sets
zbMATH Keywords: PD-sets
author: J. D. Key
author: Padmapani Seneviratne
describes a project that uses: Magma
MaRDI profile type: Publication
full work available at URL: j.ejc.2005.09.001
OpenAlex ID: W1982311311
cites work: Q4004114
cites work: Q4234284
cites work: Minimal permutation sets for decoding the binary Golay codes (Corresp.)
cites work: Q4242024
cites work: Q4677926
cites work: Information sets and partial permutation decoding for codes from finite geometries
cites work: Partial permutation decoding for codes from finite planes
cites work: Q3428630
cites work: Permutation decoding for the binary codes from triangular graphs.
cites work: Permutation decoding for binary codes from lattice graphs
cites work: Permutation Decoding of Systematic Codes
cites work: Q4146667
cites work: On coverings
DOI: 10.1016/J.EJC.2005.09.001
description: scientific article; zbMATH DE number 5077692