On the maximum size of ultrametric orthogonal sets over discrete valued fields
From MaRDI portal
Publication:6651902
DOI10.1007/S10623-024-01480-0MaRDI QIDQ6651902FDOQ6651902
Authors: Noy Soffer Aranov, Angelot Behajaina
Publication date: 11 December 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Recommendations
Partitions of sets (05A18) Extremal set theory (05D05) Structure theory for finite fields and commutative rings (number-theoretic aspects) (11T30)
Cites Work
- Title not available (Why is that?)
- \(S\)-adic version of Minkowski's geometry of numbers and Mahler's compactness criterion
- Title not available (Why is that?)
- The number of linearly independent binary vectors with applications to the construction of hypercubes and orthogonal arrays, pseudo \((t,m,s)\)-nets and linear codes
- The cardinality of sets of \(k\)-independent vectors over finite fields
- Title not available (Why is that?)
- On proper secrets, \((t,k)\)-bases and linear codes
- Large sets of nearly orthogonal vectors
- An analogue to Minkowski's geometry of numbers in a field of series
- Sets of vectors with many orthogonal pairs
- Sets with many pairs of orthogonal vectors over finite fields
- Algebraic functions and analogue of the geometry of numbers: The Riemann- Roch theorem
- Almost orthogonal subsets of vector spaces over finite fields
- Parametric geometry of numbers in function fields
This page was built for publication: On the maximum size of ultrametric orthogonal sets over discrete valued fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6651902)