• Home
  • Search
  • Local coordinates of a trellis source code
  • Cite Icon1
  • https://doi.org/10.1109/isit.2010.5513274Copy DOI Icon

Local coordinates of a trellis source code

  • Jun 1, 2010
  • J C Kieffer +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Let G k be the de Bruijn graph with 2k vertices. When reproduction labels from a 4-letter alphabet A 4 are assigned linearly to the edges of G k using a three row binary generating matrix, a 2k-state trellis code results which is suitable for encoding a source with alphabet A 4 at a rate of one bit per source sample with respect to the Hamming fidelity criterion. There is a special type of code which results in this way called systematic code. A systematic code belongs to three sets of codes, each set isomorphic to a residue class ring of polynomials over GF(2). A systematic code sweeps out a cycle in each of its three residue class rings via repeated multiplication by the residue class of polynomial x. The local coordinates of a systematic code are non-negative integer parameters which describe how the code is positioned in each of its three cycles. Our main result is that a systematic code is uniquely determined by its local coordinates, except in rare instances. The paper concludes with some preliminary work indicating how a code with good distortion performance in coding a memoryless source with alphabet A 4 can be found in relatively small sets of systematic codes whose local coordinates are of a certain type.

Similar Papers
  • Research Article
  • Citations1

Semantic Interoperability Adheres to Proper Models and Code Systems - A Detailed Examination of Different Approaches for Score Systems

  • Jan 01, 2009
  • European Journal for Biomedical Informatics
  • Frank Oemig +1
  • Research Article

New 2005 CPT Codes

  • Jan 01, 2005
  • AAP Pediatric Coding Newsletter
  • Joel Bradley
  • Book Chapter
  • Citations5

Shuffle vs. Kautz/De Bruijn Logical Topologies for Multihop Networks: a Throughput Comparison

  • Jan 01, 1996
  • F Bernabei +3
  • Research Article
  • Citations40

DeBGR: an efficient and near-exact representation of the weighted de Bruijn graph.

  • Jul 12, 2017
  • Bioinformatics
  • Prashant Pandey +3
  • Book Chapter

P-Realizable Boolean Functions and Universal Binary Neurons

  • Jan 01, 2000
  • Igor N. Aizenberg +2
  • Research Article

СИНТЕЗ БИНАРНЫХ R-КОДОВ

  • Feb 01, 2015
  • Informatsionno-upravliaiushchie sistemy (Information and Control Systems)
  • Yu Cheprukov
  • Conference Article
  • Citations8

Generalized method for constructing modulatable periodic complete complementary codes

  • Mar 20, 2001
  • H Torii +2
  • Research Article
  • Citations196

Generalized cluster complexes and Coxeter combinatorics

  • Jan 01, 2005
  • International Mathematics Research Notices
  • Sergey Fomin +1
  • Conference Article
  • Citations25

Rainbowfish: A Succinct Colored de Bruijn Graph Representation

  • Jan 01, 2017
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Fatemeh Almodaresi +2
  • Conference Article
  • Citations92

Multihop lightwave networks based on De Bruijn graphs

  • Jan 01, 1991
  • K Sivarajan +1
  • Research Article
  • Citations1

Convolutional doubly orthogonal codes over GF ( q )

  • Jul 01, 2013
  • IET Communications
  • Xu Hua Shen +2
  • PDF
  • Research Article
  • Citations4

Accurate determination of node and arc multiplicities in de bruijn graphs using conditional random fields

  • Sep 14, 2020
  • BMC Bioinformatics
  • Aranka Steyaert +2
  • PDF
  • Research Article
  • Citations182

Bifrost: highly parallel construction and indexing of colored and compacted de Bruijn graphs

  • Sep 17, 2020
  • Genome Biology
  • Guillaume Holley +1
  • Book Chapter
  • Citations5

On NP-Hardness of the Paired de Bruijn Sound Cycle Problem

  • Jan 01, 2013
  • Evgeny Kapun +1
  • Research Article
  • Citations17

An efficient algorithm for DNA fragment assembly in MapReduce

  • Aug 29, 2012
  • Biochemical and Biophysical Research Communications
  • Baomin Xu +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.