A Metrization for Power-Sets with Applications to Combinatorial Analysis
From MaRDI portal
Publication:3267409
Cited in
(21)- (6,3)-MDS codes over an alphabet of size 4
- Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\)
- MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes
- Some distribution numbers of the hypercubic association scheme
- Algebraic theory of block codes detecting independent errors
- Quantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\)
- Coprimitive sets and inextendable codes
- Latin cubes orthogonal to their transposes, a ternary analogue of Stein quasigroups
- Some generalizations of Rédei’s theorem
- Classification of Graeco-Latin Cubes
- Matrices of zeros and ones
- Maximum distance separable codes and arcs in projective spaces
- Note on maximal distance separable codes
- On the nonexistence of certain M.D.S. codes and projective planes
- A combinatorial problem with applications to geometry
- Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\)
- A vector-space packing problem
- A note on the existence of special Laguerre i-structures and optimal codes
- Maximal AMDS codes
- Permanents of d-dimensional matrices
- Extremal configurations and decomposition theorems. I
This page was built for publication: A Metrization for Power-Sets with Applications to Combinatorial Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3267409)
