Pages that link to "Item:Q4611066"

The following pages link to Error Detecting and Error Correcting Codes (Q4611066):

Displaying 50 items.

• Blockwise Lee error-correcting codes (Q1141119) (← links)
• Necessary and sufficient number of parity checks in codes correcting random errors and bursts with weight constraints under a new metric (Q1143994) (← links)
• A bound for random and closed loop burst error detecting codes (Q1148292) (← links)
• An upper bound for codes detecting low-density closed-loop bursts (Q1153875) (← links)
• Unrestricted codes with the Golay parameters are unique (Q1218393) (← links)
• Some bounds on the complexity of predicate recognition by finite automata (Q1234679) (← links)
• Bounds on the number of Hamiltonian circuits in the n-cube (Q1235718) (← links)
• Contributions to the geometry of Hamming spaces (Q1242920) (← links)
• Search problems: One, two or many rounds (Q1344611) (← links)
• Small weight bases for Hamming codes (Q1391316) (← links)
• Web mining with relational clustering (Q1394980) (← links)
• Lower bounds for centered and wrap-around \(L_2\)-discrepancies and construction of uniform designs by threshold accepting. (Q1426054) (← links)
• Structural relatedness via flow networks in protein sequence space (Q1625916) (← links)
• Distance measures with heavy aggregation operators (Q1630784) (← links)
• Design of \(\mathcal{T}\)-\textit{direct} codes over \(\mathrm{GF}(2^N)\) with increased users (Q1633300) (← links)
• A re-characterization of the Kemeny distance (Q1633666) (← links)
• Interactive communication with unknown noise rate (Q1641020) (← links)
• Hierarchical parallel evaluation of a Hamming code (Q1662715) (← links)
• Iterative voting and acyclic games (Q1677436) (← links)
• Asymptotic stability in probability for stochastic Boolean networks (Q1679063) (← links)
• The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm (Q1681158) (← links)
• Period recovery of strings over the Hamming and edit distances (Q1698696) (← links)
• Modeling value disagreement (Q1706742) (← links)
• Probing the protein space for extending the detection of weak homology folds (Q1715191) (← links)
• Hamming code based watermarking scheme for 3D model verification (Q1717923) (← links)
• The sextuply shortened binary Golay code is optimal (Q1727350) (← links)
• Adversarial classification using signaling games with an application to phishing detection (Q1741294) (← links)
• A perturbation matheuristic for the integrated personnel shift and task re-scheduling problem (Q1749483) (← links)
• The search-and-remove algorithm for biobjective mixed-integer linear programming problems (Q1754323) (← links)
• The effect of the asymmetry of road transportation networks on the traveling salesman problem (Q1762144) (← links)
• The uncertain probabilistic OWA distance operator and its application in group decision making (Q1788739) (← links)
• Skew constacyclic codes over finite fields and finite chain rings (Q1793100) (← links)
• The existence of perfect codes in a family of generalized Fibonacci cubes (Q1799596) (← links)
• Probabilistic OWA distances applied to asset management (Q1800282) (← links)
• A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry (Q1802134) (← links)
• A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound (Q1802135) (← links)
• A bound for codes correcting random and low-density closed-loop burst errors (Q1918187) (← links)
• A comparison of three metaheuristics for the workover rig routing problem (Q1926698) (← links)
• Codes, cubes, and graphical designs (Q1982601) (← links)
• Synthesis of self-checking combination devices based on allocating special groups of outputs (Q1992268) (← links)
• Network design model to integrate shelter assignment with contraflow operations in emergency evacuation planning (Q2005795) (← links)
• Connectivity and edge-bipancyclicity of Hamming shell (Q2008085) (← links)
• Characterizing permissibility, proper rationalizability, and iterated admissibility by incomplete information (Q2021790) (← links)
• M-theory cosmology, octonions, error correcting codes (Q2024303) (← links)
• On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability (Q2031639) (← links)
• The maximum diversity assortment selection problem (Q2040441) (← links)
• The exact multiple pattern matching problem solved by a reference tree approach (Q2044955) (← links)
• How to choose a fair delegation? (Q2074063) (← links)
• Application of \(\mathcal{T}\)-direct codes in multiple-rate codes (Q2079994) (← links)
• Variable-length codes independent or closed with respect to edit relations (Q2084770) (← links)