scientific article; zbMATH DE number 1867238
From MaRDI portal
Publication:4793326
zbMath1021.94530arXivmath/0207197MaRDI QIDQ4793326
Publication date: 11 February 2003
Full work available at URL: https://arxiv.org/abs/math/0207197
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveypacket lossVarshamov-Tenengolts codesshift-register sequencesbinary single-deletion-correcting codes
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Other types of codes (94B60)
Related Items (34)
A sublattice of the Leech lattice ⋮ On characterization of maximal independent sets via quadratic optimization ⋮ Weight distributions of linear codes and the Gleason-Pierce theorem ⋮ Lattices with theta functions for G(\(\sqrt{2})\) and linear codes ⋮ Analogue of vertex operator triality for ternary codes ⋮ Variable-Length Bit Mapping and Error-Correcting Codes for Higher-Order Alphabet PUFs ⋮ Examples of even unimodular extremal lattices of rank 40 and their Siegel theta-series of degree 2 ⋮ Construction of deletion correcting codes using generalized Reed-Solomon codes and their subcodes ⋮ Unweighted linear congruences with distinct coordinates and the Varshamov-Tenengolts codes ⋮ The Modular Subset-Sum Problem and the size of deletion correcting codes ⋮ Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations ⋮ On self-dual, doubly even codes of length 32 ⋮ The packing number of the double vertex graph of the path graph ⋮ A number theoretic formula and asymptotic optimality of cardinalities of BAD correcting codes ⋮ On the Varshamov-Tenengolts construction on binary strings ⋮ Combinatorics of Boolean automata circuits dynamics ⋮ Deletion correcting codes meet the Littlewood-Offord problem ⋮ Construction of single-deletion-correcting DNA codes using CIS codes ⋮ Self-dual codes over GF(5) ⋮ On the enumeration of lattices of determinant one ⋮ The unimodular lattices of dimension up to 23 and the Minkowski-Siegel mass constants ⋮ An \(E_ 8-\)approach to the Leech lattice and the Conway group ⋮ BCH Codes with Minimum Distance Proportional to Code Length ⋮ Rotation symmetric Boolean functions-count and cryptographic properties ⋮ Self-dual codes over the integers modulo 4 ⋮ An efficiently generated family of binary de Bruijn sequences ⋮ A class of group divisible 3-designs and their applications ⋮ Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes ⋮ New bounds on the number of unit spheres that can touch a unit sphere in n dimensions ⋮ A constructive count of rotation symmetric functions ⋮ On the nonexistence of extremal self-dual codes ⋮ A number theoretic view on binary shift registers ⋮ Dynamic node packing ⋮ A gluing technique for constructing relatively self-dual codes
Uses Software
This page was built for publication:
