scientific article; zbMATH DE number 1734711

zbMATH Open0994.11028arXivmath/9909163MaRDI QIDQ4328693FDOQ4328693

M. M. Skriganov

Publication date: 1 October 2002

Full work available at URL: https://arxiv.org/abs/math/9909163

Title of this publication is not available (Why is that?)

Recommendations

• Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes
• Duality for digital nets and its applications
• Maximum distance codes in Mat\(_{n,s}(\mathbb Z_k)\) with a non-Hamming metric and uniform distributions
• scientific article; zbMATH DE number 2109875
• Explicit constructions in the classical mean squares problem in irregularities of point distribution

zbMATH Keywords

maximum distance separable codesweight spectranon-Hamming metricgeneralized MacWilliams identitiesHermite interpolations over finite fieldsoptimum distributions

Mathematics Subject Classification ID

Irregularities of distribution, discrepancy (11K38) Other types of codes (94B60) Continuous, (p)-adic and abstract analogues (11K41)

Cited In (26)

• Linear codes on posets with extension property
• Association schemes on general measure spaces and zero-dimensional abelian groups
• Orthogonality and Digit Shifts in the Classical Mean Squares Problem in Irregularities of Point Distribution
• MacWilliams-type identities for fragment and sphere enumerators
• On linear codes with large weights simultaneously for the Rosenbloom-Tsfasman and Hamming metrics
• Title not available (Why is that?)
• On normal \(q\)-ary codes in Rosenbloom-Tsfasman metric
• The complete weight enumerator for codes over \(\mathcal M_{n\times s}(R)\)
• Coding‐theoretic constructions for (t,m,s)‐nets and ordered orthogonal arrays
• Existence of small ordered orthogonal arrays
• RT distances and Hamming distances of constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
• The covering problem in Rosenbloom-Tsfasman spaces
• Linear codes over \({\mathbb F}_{q}[u]/(u^s)\) with respect to the Rosenbloom-Tsfasman metric
• Title not available (Why is that?)
• Ordered covering arrays and upper bounds on covering codes
• Classification of weighted posets and digraphs admitting the extended Hamming code to be a perfect code
• Automorphism group of the crown-weight space
• Fractional decoding and the Rosenbloom-Tsfasman metric
• Maximum distance separable codes in the \(\rho\) metric over arbitrary alphabets
• Codes over Galois rings with respect to the Rosenbloom-Tsfasman metric
• Central limit theorem for \((t,s)\)-sequences in base 2
• Improved bounds on the gain coefficients for digital nets in prime power base
• MDS and \(I\)-perfect poset block codes
• On Rosenbloom and Tsfasman's generalization of the Hamming space
• The automorphism group of a linear space with the Rosenbloom-Tsfasman metric
• Efficient Integer Coding for Arbitrary Probability Distributions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4328693)