Permutation codes via fragmentation of group orbits

Janos Barta, Roberto Montemanni, Derek H. Smith

Allbwn ymchwil: Pennod mewn Llyfr/Adroddiad/Trafodion CynhadleddCyfraniad i gynhadleddadolygiad gan gymheiriaid

Crynodeb

This work presents an approach to the Maximum Permutation Code Problem (MPCP) that exploits the orbits of permutation groups in a new way. Several scientific works of recent years studied the principle of building feasible codes by combining the orbits of single permutation groups. However, the idea of combining orbits stemming from more than one group has not been explored yet. This paper presents some experiments and results with a multi-group approach. Furthermore, it explores the potential of using subsets of orbits (fragments) instead of entire orbits. The concept of minimum distance code is introduced and studied in the special case of the orbits of cyclic groups. Computational experiments carried out with a branch and bound algorithm show the potential of this approach to obtain new lower bounds on open MPCP problems.
Iaith wreiddiolSaesneg
Teitl2015 3rd International Conference on Information and Communication Technology (ICoICT)
Tudalennau39-44
ISBN (Electronig)978-1-4799-7752-9
Dynodwyr Gwrthrych Digidol (DOIs)
StatwsCyhoeddwyd - Mai 2015
Digwyddiad2015 3rd International Conference on Information and Communication Technology (ICoICT ) - Nusa Dua, Bali, Indonesia
Hyd: 27 May 201529 May 2015

Cynhadledd

Cynhadledd2015 3rd International Conference on Information and Communication Technology (ICoICT )
Cyfnod27/05/1529/05/15

Ôl bys

Gweld gwybodaeth am bynciau ymchwil 'Permutation codes via fragmentation of group orbits'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

Dyfynnu hyn