On the dual distance and the gap of a binary code (Q1584453): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q4023377 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3992965 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5598243 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3907599 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Diameter, covering index, covering radius and eigenvalues / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3880849 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4873761 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4146667 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Canonical Concurrent Flows, Crossing Number and Graph Expansion / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The edge-forwarding index or orbital regular graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Expanding and forwarding / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(98)00080-6 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1998195989 / rank | |||
Normal rank |
Latest revision as of 10:36, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the dual distance and the gap of a binary code |
scientific article |
Statements
On the dual distance and the gap of a binary code (English)
0 references
2 November 2000
0 references
gap symmetric codes
0 references
average distortion
0 references
average distance
0 references
symmetric graphs
0 references
lower bound
0 references