Bounds for the size of a minimal 1-perfect bitrade in a Hamming graph

We improve the available upper and lower bounds for the minimal size of the support of an eigenfunction of the Hamming graph H ( n, q ), where q > 2. In particular, the size of a minimal 1-perfect bitrade in H ( n, q ) is estimated. We show that the size of such a bitrade is at least 2 n −( n −1)...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of applied and industrial mathematics 2015, Vol.9 (1), p.141-146
Hauptverfasser:	Vorob’ev, K. V., Krotov, D. S.
Format:	Artikel
Sprache:	eng
Schlagworte:	Codes Construction Eigenfunctions Eigenvalues Graph theory Graphs Lower bounds Mathematical analysis Mathematics Mathematics and Statistics Polynomials Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!