Bounds on Codes

1992 ◽  
pp. 58-74
Author(s):  
J. H. van Lint
Keyword(s):  
Bounds On Codes

scholarly journals Bounds on Codes Based on Graph Theory

2007 ◽  
Author(s):  
Salim Y. El Rouayheb ◽  
Costas N. Georghiades ◽  
Emina Soljanin ◽  
Alex Sprintson
Keyword(s):  
Graph Theory ◽  
Bounds On Codes

Bounds on Codes Derived by Counting Components in Varshamov Graphs

2006 ◽  
Vol 39 (3) ◽  
pp. 387-396 ◽  
Author(s):  
Katie M. O’Brien ◽  
Patrick Fitzpatrick
Keyword(s):  
Bounds On Codes

Bounds on codes

2000 ◽  
pp. 9-15
Author(s):  
Judy Walker
Keyword(s):  
Bounds On Codes

scholarly journals Spectral approach to linear programming bounds on codes

2006 ◽  
Vol 42 (2) ◽  
pp. 77-89 ◽  
Author(s):  
A. M. Barg ◽  
D. Yu. Nogin
Keyword(s):  
Linear Programming ◽  
Spectral Approach ◽  
Bounds On Codes

scholarly journals Locating and Identifying Codes in Circulant Graphs

2021 ◽  
Vol 2021 ◽  
pp. 1-9
Author(s):  
Shu Jiao Song ◽  
Weiqian Zhang ◽  
Can Xu
Keyword(s):  
Circulant Graphs ◽  
Identifying Codes ◽  
Bounds On Codes ◽  
Optimal Bounds

Identifying and locating-dominating codes have been studied widely in circulant graphs. Recently, Ville Junnila et al. (Optimal bounds on codes for location in circulant graphs, Cryptography and Communications; 2019) studied identifying and locating-dominating codes in circulants C n 1 , d , C n 1 , d − 1 , d , and C n 1 , d − 1 , d , d + 1 . In this paper, identifying, locating, and self-identifying codes in the circulant graphs C n k , d , C n k , d − k , d , and C n k , d − k , d , d + k are studied, and this extends Junnila et al.’s results to general cases.

Bounds on codes

1988 ◽  
pp. 25-27
Author(s):  
Jacobus H. van Lint ◽  
Gerard van der Geer
Keyword(s):  
Bounds On Codes
Sign in / Sign up

Export Citation Format

Share Document