Binary \(B_2\)-sequences: a new upper bound (Q5937131): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Collusion-secure fingerprinting for digital data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4256493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determination of two vectors from the sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(B_ 2\)-sequences of vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds on error exponents / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on<tex>|C_2|</tex>for a uniquely decodable code pair<tex>(C_1, C_2)</tex>for a two-access binary adder channel / rank
 
Normal rank

Latest revision as of 18:12, 3 June 2024

scientific article; zbMATH DE number 1618556
Language Label Description Also known as
English
Binary \(B_2\)-sequences: a new upper bound
scientific article; zbMATH DE number 1618556

    Statements

    Binary \(B_2\)-sequences: a new upper bound (English)
    0 references
    0 references
    0 references
    0 references
    29 October 2001
    0 references
    Für eine \(B_2\)-Folge von Vektoren gilt, dass die Summen \(x+y\) verschieden sind für alle verschiedenen Paare \(\{x,y\}\) von Elementen aus \(B_2\). Es wird eine Abschätzung für die Anzahlfunktion einer \(B_2\)-Folge gegeben, womit ein Resultat von \textit{B. Lindström} [J. Number Theory 4, 261-265 (1972; Zbl 0235.10028)] verbessert wird.
    0 references
    0 references
    \(B_2\)-sequences of vectors
    0 references
    counting function
    0 references
    upper bound
    0 references
    0 references