Menu
Home
Contact us
Stats
Categories
Calendar
Toggle Wiki
Wiki Home
Last Changes
Rankings
List pages
Orphan pages
Sandbox
Print
Toggle Image Galleries
Galleries
Rankings
Toggle Articles
Articles home
List articles
Rankings
Toggle Blogs
List blogs
Rankings
Toggle Forums
List forums
Rankings
Toggle File Galleries
List galleries
Rankings
Toggle Maps
Mapfiles
Toggle Surveys
List surveys
Stats
ITHEA Classification Structure > F. Theory of Computation  > F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY 
CLASSIFICATION RESULTS FOR (v, k, 1) CYCLIC DIFFERENCE FAMILIES WITH SMALL ...
By: Tsonka Baicheva, Svetlana Topalova (3826 reads)
Rating: (1.00/10)

Abstract: Classifications of (v, k, 1) cyclic difference families (CDFs) by other authors are known for k = 3 and v  57, k = 4 and v  64, k = 5 and v  65, k = 6 and v = 91 and k = 7 and v = 91. In this work we construct all inequivalent (v, k, 1) CDFs (respectively all multiplier inequivalent cyclic 2-(v, k, 1) designs) with k  11 and some small v by a computer search and an algorithm similar to the one applied for the classification of optimal orthogonal codes in our previous works. We obtain the same number of inequivalent CDFs for all the parameters, for which previous classification results are known. The new parameters covered by our software for k  7 are (61, 3, 1), (73, 4, 1), (76, 4, 1), (81, 5, 1), and (85, 5, 1) CDFs.

Keywords: cyclic difference set, Steiner triple system, optical orthogonal code

ACM Classification Keywords: Algorithms

Link:

CLASSIFICATION RESULTS FOR (v, k, 1) CYCLIC DIFFERENCE FAMILIES WITH SMALL PARAMETERS

Tsonka Baicheva, Svetlana Topalova

http://www.foibg.com/ibs_isc/ibs-25/ibs-25-p02.pdf

Print
F.2 ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY
article: SOME METHODOLOGICAL APPROACHES TO THE PROBLEM OF "UNDERSTANDING THE UNDERSTANDIN · SYSTEM MODIFICATION MODEL CREATING SYNTHESIS FOR ALGORITHM FORMULAS · CLASSIFICATION RESULTS FOR (v, k, 1) CYCLIC DIFFERENCE FAMILIES WITH SMALL ... · A CONCEPT OF A MODEL OF A COMPUTER SYSTEM FOR FORMING COMPLEX UNITERMS · ОБ ОДНОЙ ЗАДАЧЕ РАСПОЗНАВАНИЯ ПОСЛЕДОВАТЕЛ · ЗАДАЧИ ПОМЕХОУСТОЙЧИВОГО АНАЛИЗА И РАСПОЗН · О НЕКОТОРЫХ ТРУДНОРЕШАЕМЫХ ЗАДАЧАХ ПОМЕХОУ ·
Login
[ register | I forgot my password ]
World Clock
Powered by Tikiwiki Powered by PHP Powered by Smarty Powered by ADOdb Made with CSS Powered by RDF powered by The PHP Layers Menu System
RSS Wiki RSS Blogs rss Articles RSS Image Galleries RSS File Galleries RSS Forums RSS Maps rss Calendars
[ Execution time: 0.08 secs ]   [ Memory usage: 7.51MB ]   [ GZIP Disabled ]   [ Server load: 0.18 ]
Powered by Tikiwiki CMS/Groupware