scientific article
From MaRDI portal
Publication:4004140
zbMath0752.94001MaRDI QIDQ4004140
Publication date: 18 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Theory of error-correcting codes and error-detecting codes (94Bxx)
Related Items (81)
An information-geometric approach to a theory of pragmatic structuring ⋮ The GL-module structure of the Hochschild homology of truncated tensor algebras. ⋮ Efficient Huffman decoding ⋮ Theory of minimum aberration blocked regular mixed factorial designs ⋮ Unnamed Item ⋮ Computing the edit distance of a regular language ⋮ Relative generalized Hamming weights over Frobenius rings ⋮ On optimal codes with \(w\)-identifiable parent property ⋮ A Radio Coloring of a Hypercube ⋮ Unnamed Item ⋮ On some optimization problems in molecular biology ⋮ Theory of optimal blocking of nonregular factorial designs ⋮ Authentication codes for nontrusting parties obtained from rank metric codes ⋮ On Binary Linear Codes Whose Automorphism Group is Trivial ⋮ Detecting non-isomorphic orthogonal design ⋮ Projective systems whose support is the union of two linear subspaces with nonempty intersection ⋮ Minimum secondary aberration fractional factorial split-plot designs in terms of consulting designs ⋮ A combinedgreedy-walkheuristic and simulated annealing approach for the closest string problem ⋮ Dual of codes over finite quotients of polynomial rings ⋮ New linear codes from constacyclic codes ⋮ BCH codes and distance multi- or fractional colorings in hypercubes asymptotically ⋮ Minimal zero-sum sequences in \(C_{n}\oplus C_{n}\) ⋮ Landscapes and their correlation functions ⋮ Univariate polynomial factorization over finite fields ⋮ Fiber entropy and algorithmic complexity of random orbits ⋮ Characteristics of invariant weights related to code equivalence over rings ⋮ SIMPLE FAULT-TOLERANT ENCODING OVER q-ARY CSS QUANTUM CODES ⋮ Quantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\) ⋮ Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\) ⋮ Complementary design theory for sliced equidistance designs ⋮ New non-isomorphic detection methods for orthogonal designs ⋮ An extension of a construction of covering arrays ⋮ Generalized wordtype pattern for nonregular factorial designs with multiple groups of factors ⋮ Fractal attractors and singular invariant measures in two-sector growth models with random factor shares ⋮ On Steinitz classes of nonabelian Galois extensions and \(p\)-ary cyclic Hamming codes ⋮ MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes ⋮ On self-dual cyclic codes over finite chain rings ⋮ Realizable Galois module classes over the group ring for non abelian extensions ⋮ The Poincaré Polynomial of a Linear Code ⋮ Sets with maximum hamming index ⋮ An inequality for logarithms and applications in information theory. ⋮ Matrix product codes over finite commutative Frobenius rings ⋮ A new proof of commutative case of Wood's theorem characterizing rings with a generating character ⋮ Linear system modelization of concatenated block and convolutional codes ⋮ Self-similar measures in multi-sector endogenous growth models ⋮ Variable-length codes for error correction ⋮ GARCH model selection criteria ⋮ On realizable Galois module classes and Steinitz classes of nonabelian extensions ⋮ Some new linear codes from skew cyclic codes and computer algebra challenges ⋮ Serial concatenation of a block code and a 2D convolutional code ⋮ Efficient solutions for the far from most string problem ⋮ Multisecret-sharing schemes and bounded distance decoding of linear codes ⋮ The Secret Life of Keys: On the Calculation of Mechanical Lock Systems ⋮ THE ITERATION DIGRAPHS OF GROUP RINGS OVER FINITE FIELDS ⋮ On bounds for codes over Frobenius rings under homogeneous weights ⋮ Sharpening the Gilbert-Varshamov bound in the finite case ⋮ Linear circulant matrices over a finite field. ⋮ Consistency degrees of finite theories in Łukasiewicz propositional fuzzy logic ⋮ On the isomorphism of fractional factorial designs ⋮ Multistratum fractional factorial split-plot designs with minimum aberration and maximum estimation capacity ⋮ Exact algorithm and heuristic for the closest string problem ⋮ Hairpin Structures in DNA Words ⋮ An enhanced fractal image denoising algorithm ⋮ Sparse hypercube -- a minimal \(k\)-line broadcast graph. ⋮ OUTCOME UNCERTAINTY AND INTERESTEDNESS IN GAME-PLAYING: A CASE STUDY USING SYNCHRONIZED HEX ⋮ A new chaotic function and its cryptographic usage ⋮ ENTANGLEMENT CONCENTRATION AND DILUTION REVISITED ⋮ A coloring problem on the \(n\)-cube ⋮ On the stability of periodic binary sequences with zone restriction ⋮ Match fitness landscapes for macromolecular interaction networks: selection for translational accuracy and rate can displace tRNA-binding interfaces of non-cognate aminoacyl-tRNA synthetases ⋮ A space-efficient Huffman decoding algorithm and its parallelism ⋮ Generalized minimum aberration for asymmetrical fractional factorial designs ⋮ Generalized minimum aberration for asymmetrical fractional factorial designs. ⋮ New bounds on a hypercube coloring problem. ⋮ Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\) ⋮ Unnamed Item ⋮ Ranks of tensors, secant varieties of Segre varieties and fat points ⋮ Information-bit error rate and false positives in an MDS code ⋮ Error-detecting properties of languages ⋮ Recovering erasures by using MDS codes over extension alphabets ⋮ Characterization of minimum aberration mixed factorials in terms of consulting designs
This page was built for publication:
