Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length <i>n</i> = 2<sup><i>k</i></sup> ± 1 and Weight 3 (Q4929280): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Hung-Lin Fu / rank
Normal rank
 
Property / author
 
Property / author: Hung-Lin Fu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jcd.21332 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1933645118 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Conflict-Avoiding Codes of Even Length and Weight 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal conflict-avoiding codes of odd length and weight three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of protocol sequences for multiple access collision channel without feedback / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-avoiding codes and cyclic triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of codes for a T active users out of N multiple-access communication system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cyclic \(2(k-1)\)-support \((n,k)_{k-1}\) difference families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant Weight Conflict-Avoiding Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of binary constant-weight cyclic codes and cyclically permutable codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight asymptotic bound on the size of constant-weight conflict-avoiding codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some constructions of conflict-avoiding codes / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:24, 6 July 2024

scientific article; zbMATH DE number 6175539
Language Label Description Also known as
English
Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length <i>n</i> = 2<sup><i>k</i></sup> ± 1 and Weight 3
scientific article; zbMATH DE number 6175539

    Statements

    Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length <i>n</i> = 2<sup><i>k</i></sup> ± 1 and Weight 3 (English)
    0 references
    0 references
    0 references
    13 June 2013
    0 references
    conflict-avoiding codes
    0 references
    equi-difference
    0 references
    optimal codes
    0 references

    Identifiers