Two-Dimensional Array Coloring With Many Colors

Given an m times n array and k distinct colors with 2les m les n and 2les k < mn , we consider the problem of marking each location in the array using one of the k given colors such that any two locations in the array marked by the same color are separated as much as possible. This problem is rel...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory 2008-09, Vol.54 (9), p.4391-4394
Hauptverfasser:	Wen-Qing Xu, Golomb, S.W.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Arrays Clusters Codes Coding, codes Coloring coloring distance cyclic shifting Error correction Error correction codes Errors Exact sciences and technology Information processing Information theory Information, signal and communications theory Interleaved codes interleaving Manganese Mathematics Optimization Position (location) Power engineering and energy random error-correcting codes Signal and communications theory sphere packing Statistics Telecommunications and information theory Two dimensional Two dimensional displays
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!