The following pages link to (Q4004140):
Displaying 50 items.
- Recovering erasures by using MDS codes over extension alphabets (Q258876) (← links)
- Efficient Huffman decoding (Q286977) (← links)
- Complementary design theory for sliced equidistance designs (Q419170) (← links)
- Self-similar measures in multi-sector endogenous growth models (Q506810) (← links)
- Consistency degrees of finite theories in Łukasiewicz propositional fuzzy logic (Q703371) (← links)
- Exact algorithm and heuristic for the closest string problem (Q716344) (← links)
- Characterization of minimum aberration mixed factorials in terms of consulting designs (Q816532) (← links)
- Projective systems whose support is the union of two linear subspaces with nonempty intersection (Q862558) (← links)
- Minimum secondary aberration fractional factorial split-plot designs in terms of consulting designs (Q862693) (← links)
- BCH codes and distance multi- or fractional colorings in hypercubes asymptotically (Q868374) (← links)
- Minimal zero-sum sequences in \(C_{n}\oplus C_{n}\) (Q872029) (← links)
- Linear system modelization of concatenated block and convolutional codes (Q935388) (← links)
- On realizable Galois module classes and Steinitz classes of nonabelian extensions (Q958669) (← links)
- Univariate polynomial factorization over finite fields (Q1127311) (← links)
- Landscapes and their correlation functions (Q1381249) (← links)
- A coloring problem on the \(n\)-cube (Q1570845) (← links)
- A space-efficient Huffman decoding algorithm and its parallelism (Q1583590) (← links)
- Error-detecting properties of languages (Q1605317) (← links)
- New linear codes from constacyclic codes (Q1659442) (← links)
- A new proof of commutative case of Wood's theorem characterizing rings with a generating character (Q1728782) (← links)
- Efficient solutions for the far from most string problem (Q1761847) (← links)
- On bounds for codes over Frobenius rings under homogeneous weights (Q1763332) (← links)
- Linear circulant matrices over a finite field. (Q1767231) (← links)
- Multistratum fractional factorial split-plot designs with minimum aberration and maximum estimation capacity (Q1771448) (← links)
- Sparse hypercube -- a minimal \(k\)-line broadcast graph. (Q1811066) (← links)
- Generalized minimum aberration for asymmetrical fractional factorial designs (Q1848871) (← links)
- Generalized minimum aberration for asymmetrical fractional factorial designs. (Q1848896) (← links)
- New bounds on a hypercube coloring problem. (Q1853150) (← links)
- Ranks of tensors, secant varieties of Segre varieties and fat points (Q1855380) (← links)
- An information-geometric approach to a theory of pragmatic structuring (Q1872264) (← links)
- The GL-module structure of the Hochschild homology of truncated tensor algebras. (Q1877752) (← links)
- Theory of minimum aberration blocked regular mixed factorial designs (Q1888870) (← links)
- Authentication codes for nontrusting parties obtained from rank metric codes (Q1904420) (← links)
- Characteristics of invariant weights related to code equivalence over rings (Q1934233) (← links)
- Realizable Galois module classes over the group ring for non abelian extensions (Q1955963) (← links)
- An inequality for logarithms and applications in information theory. (Q1963086) (← links)
- Some new linear codes from skew cyclic codes and computer algebra challenges (Q2002144) (← links)
- Serial concatenation of a block code and a 2D convolutional code (Q2002377) (← links)
- On the stability of periodic binary sequences with zone restriction (Q2081551) (← links)
- Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\) (Q2099600) (← links)
- Relative generalized Hamming weights over Frobenius rings (Q2147527) (← links)
- Detecting non-isomorphic orthogonal design (Q2156827) (← links)
- Fractal attractors and singular invariant measures in two-sector growth models with random factor shares (Q2205808) (← links)
- MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes (Q2207991) (← links)
- Match fitness landscapes for macromolecular interaction networks: selection for translational accuracy and rate can displace tRNA-binding interfaces of non-cognate aminoacyl-tRNA synthetases (Q2329321) (← links)
- Information-bit error rate and false positives in an MDS code (Q2346708) (← links)
- Computing the edit distance of a regular language (Q2381500) (← links)
- On optimal codes with \(w\)-identifiable parent property (Q2384057) (← links)
- Dual of codes over finite quotients of polynomial rings (Q2396764) (← links)
- Generalized wordtype pattern for nonregular factorial designs with multiple groups of factors (Q2432635) (← links)
