Please use this identifier to cite or link to this item:
|Title:||Finite nilpotent and metacyclic groups never violate the Ingleton inequality||Authors:||Stancu, Radu
|Keywords:||DRNTU::Science::Mathematics||Issue Date:||2012||Source:||Stancu, R., & Oggier, F. (2012). Finite nilpotent and metacyclic groups never violate the Ingleton inequality. 2012 International Symposium on Network Coding (NetCod), pp.25- 30.||Abstract:||In , Mao and Hassibi started the study of finite groups that violate the Ingleton inequality. They found through computer search that the smallest group that does violate it is the symmetric group of order 120. We give a general condition that proves that a group does not violate the Ingleton inequality, and consequently deduce that finite nilpotent and metacyclic groups never violate the inequality. In particular, out of the groups of order up to 120, we give a proof that about 100 orders cannot provide groups which violate the Ingleton inequality.||URI:||https://hdl.handle.net/10356/94796
|DOI:||http://dx.doi.org/10.1109/NETCOD.2012.6261879||Rights:||© 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [DOI: http://dx.doi.org/10.1109/NETCOD.2012.6261879].||metadata.item.grantfulltext:||open||metadata.item.fulltext:||With Fulltext|
|Appears in Collections:||SPMS Conference Papers|
Files in This Item:
|Finite nilpotent and metacyclic groups never violate the Ingleton inequality.pdf||232.82 kB||Adobe PDF|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.