Error detecting and error correcting codes
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Stochastic modeling western paintings for effective classification
- Full rank perfect codes and -kernels
- Hamming distance for conjugates
- On the classification of perfect codes: extended side class structures
- Two-weight ternary codes and the equation y^2=4 3^+13
- 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)
- Applications of coding theory to the design of somatic cell hybrid panels
- A t-unidirectional error-detecting systematic code
- 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
- A bound for random and closed loop burst error detecting codes
- An upper bound for codes detecting low-density closed-loop bursts
- Unrestricted codes with the Golay parameters are unique
- Some bounds on the complexity of predicate recognition by finite automata
- Bounds on the number of Hamiltonian circuits in the n-cube
- Contributions to the geometry of Hamming spaces
- Search problems: One, two or many rounds
- Small weight bases for Hamming codes
- Web mining with relational clustering
- Lower bounds for centered and wrap-around \(L_2\)-discrepancies and construction of uniform designs by threshold accepting.
- Structural relatedness via flow networks in protein sequence space
- Distance measures with heavy aggregation operators
- Design of \(\mathcal{T}\)-\textit{direct} codes over \(\mathrm{GF}(2^N)\) with increased users
- A re-characterization of the Kemeny distance
- Hierarchical parallel evaluation of a Hamming code
- Iterative voting and acyclic games
- Asymptotic stability in probability for stochastic Boolean networks
- The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm
- Period recovery of strings over the Hamming and edit distances
- Modeling value disagreement
- Probing the protein space for extending the detection of weak homology folds
- Hamming code based watermarking scheme for 3D model verification
- The sextuply shortened binary Golay code is optimal
- Adversarial classification using signaling games with an application to phishing detection
- A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem
- The search-and-remove algorithm for biobjective mixed-integer linear programming problems
- The effect of the asymmetry of road transportation networks on the traveling salesman problem
- The uncertain probabilistic OWA distance operator and its application in group decision making
- Skew constacyclic codes over finite fields and finite chain rings
- The existence of perfect codes in a family of generalized Fibonacci cubes
- Probabilistic OWA distances applied to asset management
- 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
- A bound for codes correcting random and low-density closed-loop burst errors
- A comparison of three metaheuristics for the workover rig routing problem
- Codes, cubes, and graphical designs
- Synthesis of self-checking combination devices based on allocating special groups of outputs
- Network design model to integrate shelter assignment with contraflow operations in emergency evacuation planning
- Connectivity and edge-bipancyclicity of Hamming shell
- Characterizing permissibility, proper rationalizability, and iterated admissibility by incomplete information
- M-theory cosmology, octonions, error correcting codes
- On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability
- The maximum diversity assortment selection problem
- The exact multiple pattern matching problem solved by a reference tree approach
- How to choose a fair delegation?
- Application of \(\mathcal{T}\)-direct codes in multiple-rate codes
- Variable-length codes independent or closed with respect to edit relations
- Strings from linear recurrences and permutations: a gray code
- Eigenvalues and critical groups of Adinkras
- Hat problem: a new strategy based on quantum stabilizer codes
- Clustering and identification of core implications
- Multiple-rate error-correcting coding scheme
- Words that almost commute
- ConNEcT: a novel network approach for investigating the co-occurrence of binary psychopathological symptoms over time
- Design of a heuristic algorithm for the generalized multi-objective set covering problem
- Registering the evolutionary history in individual-based models of speciation
- The uncertain ordered weighted averaging adequacy coefficient operator
- Relative entropy and envy-free allocation
- A stochastic programming model with endogenous and exogenous uncertainty for reliable network design under random disruption
- A stochastic model of cytotoxic T cell responses
- On the number of edges of a uniform hypergraph with a range of allowed intersections
- Santha-Vazirani sources, deterministic condensers and very strong extractors
- A library for formalization of linear error-correcting codes
- The clique distribution in powers of hypercubes
- HOPS -- Hamming-Oriented Partition Search for production planning in the spinning industry
- Fault tolerance in distributed systems using fused state machines
- On the size of the symmetry group of a perfect code
- Model-free two-sample test for network-valued data
- Low-dimensional representation of genomic sequences
- Optimal designs for stated choice experiments generated from fractional factorial designs
- Optimal string clustering based on a Laplace-like mixture and EM algorithm on a set of strings
- Theory of supports for linear codes endowed with the sum-rank metric
- Match fitness landscapes for macromolecular interaction networks: selection for translational accuracy and rate can displace tRNA-binding interfaces of non-cognate aminoacyl-tRNA synthetases
- Optimal charging and repositioning of electric vehicles in a free-floating carsharing system
- A method for fuzzy soft sets in decision-making based on an ideal solution
- Subgraph extraction and metaheuristics for the maximum clique problem
- Learning lexicographic orders
- Contraction in propositional logic
- Implementing semantic merging operators using binary decision diagrams
- Group algebras and coding theory
- Weighted approximate parameterized string matching
- Boolean network analysis through the joint use of linear algebra and algebraic geometry
- On the interpoint distances of Bernoulli vectors
- Gene coexpression as Hebbian learning in prokaryotic genomes
- The quantitative linear-time-branching-time spectrum
- On some perfect codes with respect to Lee metric
- A stochastic programming approach for supply chain network design under uncertainty
- A clustering search metaheuristic for the point-feature cartographic label placement problem
- A survey of constructive coding theory, and a table of binary codes of highest known rate
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4611066)
