Error Detecting and Error Correcting Codes

DOI10.1002/j.1538-7305.1950.tb00463.xzbMath1402.94084WikidataQ55871133 ScholiaQ55871133MaRDI QIDQ4611066

Richard Hamming

Publication date: 23 January 2019

Published in: Bell System Technical Journal (Search for Journal in Brave)

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (only showing first 100 items - show all)

Robust variable selection for model-based learning in presence of adulteration ⋮ Structural relatedness via flow networks in protein sequence space ⋮ Distance measures with heavy aggregation operators ⋮ Incidence coloring on hypercubes ⋮ Perfect codes in Doob graphs ⋮ Design of \(\mathcal{T}\)-\textit{direct} codes over \(\mathrm{GF}(2^N)\) with increased users ⋮ A re-characterization of the Kemeny distance ⋮ Search problems: One, two or many rounds ⋮ On generalizations of separating and splitting families ⋮ Wavelet analysis on symbolic sequences and two-fold de Bruijn sequences ⋮ Interactive communication with unknown noise rate ⋮ Heuristic approaches for biobjective mixed 0-1 integer linear programming problems ⋮ Classical simulated annealing using quantum analogues ⋮ Sur le nombre domatique du n-cube et une conjecture de Zelinka. (On the domatic number of the n-cube and a conjecture of Zelinka) ⋮ An efficient image authentication method based on Hamming code ⋮ A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints ⋮ Applications of coding theory to the design of somatic cell hybrid panels ⋮ An exact algorithm for biobjective mixed integer linear programming problems ⋮ Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model ⋮ A t-unidirectional error-detecting systematic code ⋮ Hierarchical parallel evaluation of a Hamming code ⋮ A bound for codes correcting random and low-density closed-loop burst errors ⋮ Iterative voting and acyclic games ⋮ Asymptotic stability in probability for stochastic Boolean networks ⋮ A comparison of three metaheuristics for the workover rig routing problem ⋮ The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm ⋮ Ambulance location and relocation problems with time-dependent travel times ⋮ Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses ⋮ Small weight bases for Hamming codes ⋮ Web mining with relational clustering ⋮ Blockwise Lee error-correcting codes ⋮ Necessary and sufficient number of parity checks in codes correcting random errors and bursts with weight constraints under a new metric ⋮ On perfect codes in Cartesian products of graphs ⋮ A bound for random and closed loop burst error detecting codes ⋮ Determining all indecomposable codes over some Hopf algebras ⋮ Period recovery of strings over the Hamming and edit distances ⋮ An upper bound for codes detecting low-density closed-loop bursts ⋮ Modeling value disagreement ⋮ Sequence matching with binary codes ⋮ Systematic t-error correcting/all unidirectional error detecting codes with easy encoding/decoding ⋮ A new class of symmetric error correcting/unidirectional error detecting codes ⋮ Symmetric vertex partitions of hypercubes by isometric trees ⋮ Probing the protein space for extending the detection of weak homology folds ⋮ Tolerance spaces: origins, theoretical aspects and applications ⋮ Charge and reduce: A fixed-parameter algorithm for string-to-string correction ⋮ A new upper bound on nonbinary block codes ⋮ Prefix partitioned Gray codes for particular cross-bifix-free sets ⋮ Hamming code based watermarking scheme for 3D model verification ⋮ Lower bounds for centered and wrap-around \(L_2\)-discrepancies and construction of uniform designs by threshold accepting. ⋮ Text indexing with errors ⋮ The sextuply shortened binary Golay code is optimal ⋮ The quest for a quantum neural network ⋮ Group homomorphisms as error correcting codes ⋮ Adversarial classification using signaling games with an application to phishing detection ⋮ Codes, cubes, and graphical designs ⋮ A novel lossless data compression scheme based on the error correcting Hamming codes ⋮ An algorithm for approximating the Pareto set of the multiobjective set covering problem ⋮ Logic of confidence ⋮ A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem ⋮ A variable-neighbourhood search algorithm for finding optimal run orders in the presence of serial correlation ⋮ Synthesis of self-checking combination devices based on allocating special groups of outputs ⋮ Corrigendum to: ``Incidence coloring on hypercubes. ⋮ Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\) ⋮ Optimal aggregation of linear time series models ⋮ The search-and-remove algorithm for biobjective mixed-integer linear programming problems ⋮ Efficient algorithms for the block edit problems ⋮ The effect of the asymmetry of road transportation networks on the traveling salesman problem ⋮ Network design model to integrate shelter assignment with contraflow operations in emergency evacuation planning ⋮ Connectivity and edge-bipancyclicity of Hamming shell ⋮ Simplified forms of computerized reasoning with distance semantics ⋮ Unrestricted codes with the Golay parameters are unique ⋮ The intractability of computing the Hamming distance ⋮ On kernels of perfect codes ⋮ Characterizing permissibility, proper rationalizability, and iterated admissibility by incomplete information ⋮ M-theory cosmology, octonions, error correcting codes ⋮ Some bounds on the complexity of predicate recognition by finite automata ⋮ Bounds on the number of Hamiltonian circuits in the n-cube ⋮ The uncertain probabilistic OWA distance operator and its application in group decision making ⋮ Contributions to the geometry of Hamming spaces ⋮ On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability ⋮ Perfect codes from the dual point of view. I ⋮ Skew constacyclic codes over finite fields and finite chain rings ⋮ The maximum diversity assortment selection problem ⋮ The existence of perfect codes in a family of generalized Fibonacci cubes ⋮ Probabilistic OWA distances applied to asset management ⋮ Stochastic modeling western paintings for effective classification ⋮ A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry] ⋮ A construction of some \([n,k,d;q\)-codes meeting the Griesmer bound] ⋮ The exact multiple pattern matching problem solved by a reference tree approach ⋮ Full rank perfect codes and \(\alpha \)-kernels ⋮ Simulation distances ⋮ How to choose a fair delegation? ⋮ Application of \(\mathcal{T}\)-direct codes in multiple-rate codes ⋮ Hamming distance for conjugates ⋮ Hamming and simplex codes for the sum-rank metric ⋮ On the classification of perfect codes: extended side class structures ⋮ Variable-length codes independent or closed with respect to edit relations ⋮ Strings from linear recurrences and permutations: a gray code ⋮ Two-weight ternary codes and the equation \(y^2=4 \times 3^\alpha+13\) ⋮ Acceleration strategies of Benders decomposition for the security constraints power system expansion planning

This page was built for publication: Error Detecting and Error Correcting Codes