当前期刊: Advances in Mathematics of Communications Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • QC-LDPC construction free of small size elementary trapping sets based on multiplicative subgroups of a finite field
    Adv. Math. Commun. (IF 0.734) Pub Date : 2020-01-08
    Farzane Amirzade; Mohammad-Reza Sadeghi; Daniel Panario

    Trapping sets significantly influence the performance of low-density parity-check codes. An $ (a, b) $ elementary trapping set (ETS) causes high decoding failure rate and exert a strong influence on the error floor of the code, where $ a $ and $ b $ denote the size and the number of unsatisfied check-nodes in the ETS, respectively. The smallest size of an ETS in $ (3, n) $-regular LDPC codes with girth

    更新日期:2020-01-08
  • A generalized quantum relative entropy
    Adv. Math. Commun. (IF 0.734) Pub Date : 2020-01-08
    Luiza H. F. Andrade; Rui F. Vigelis; Charles C. Cavalcante

    We propose a generalization of the quantum relative entropy by considering the geodesic on a manifold formed by all the invertible density matrices $ \mathcal{P} $. This geodesic is defined from a deformed exponential function $ \varphi $ which allows to work with a wider class of families of probability distributions. Such choice allows important flexibility in the statistical model. We show and discuss

    更新日期:2020-01-08
  • On the non-Abelian group code capacity of memoryless channels
    Adv. Math. Commun. (IF 0.734) Pub Date : 2020-01-08
    Jorge P. Arpasi

    In this work is provided a definition of group encoding capacity $ C_G $ of non-Abelian group codes transmitted through symmetric channels. It is shown that this $ C_G $ is an upper bound of the set of rates of these non-Abelian group codes that allow reliable transmission. Also, is inferred that the $ C_G $ is a lower bound of the channel capacity. After that, is computed the $ C_G $ of the group

    更新日期:2020-01-08
  • A shape-gain approach for vector quantization based on flat tori
    Adv. Math. Commun. (IF 0.734) Pub Date : 2020-01-08
    Fabiano Boaventura de Miranda; Cristiano Torezzan

    In this paper we present a vector quantization framework for Gaussian sources which combines a spherical code on layers of flat tori and the shape and gain technique. The basic concepts of spherical codes in tori layers are reviewed and two constructions are presented for the shape by exploiting the $ k/2 $-dimensional lattices $ D_{k/2} $ and $ A^{*}_{k/2} $ as its pre-image. A scalar quantizer is

    更新日期:2020-01-08
  • On perfect poset codes
    Adv. Math. Commun. (IF 0.734) Pub Date : 2020-01-08
    Luciano Panek; Jerry Anderson Pinheiro; Marcelo Muniz Alves; Marcelo Firer

    We consider on $ \mathbb{F}_{q}^{n} $ metrics determined by posets and classify the parameters of $ 1 $-perfect poset codes in such metrics. We show that a code with same parameters of a $ 1 $-perfect poset code is not necessarily perfect, however, we give necessary and sufficient conditions for this to be true. Furthermore, we characterize the unique way up to a labeling on the poset, considering

    更新日期:2020-01-08
  • Challenge codes for physically unclonable functions with Gaussian delays: A maximum entropy problem
    Adv. Math. Commun. (IF 0.734) Pub Date : 2020-01-08
    Alexander Schaub; Olivier Rioul; Jean-Luc Danger; Sylvain Guilley; Joseph Boutros

    Motivated by a security application on physically unclonable functions, we evaluate the probability distributions and Rényi entropies of signs of scalar products of i.i.d. Gaussian random variables against binary codewords in $ \{\pm1\}^n $. The exact distributions are determined for small values of $ n $ and upper bounds are provided by linking this problem to the study of Boolean threshold functions

    更新日期:2020-01-08
  • The weight distribution of families of reducible cyclic codes through the weight distribution of some irreducible cyclic codes
    Adv. Math. Commun. (IF 0.734) Pub Date : 2020-01-08
    Gerardo Vega; Jesús E. Cuén-Ramos

    The calculation of the weight distribution for some reducible cyclic codes can be reduced down to the corresponding one of a particular kind of irreducible cyclic codes. This reduction is achieved by means of a known identity (see [3,Theorem 1.1]). In fact, as will be shown here, the weight distribution of some families of reducible cyclic codes, recently reported in several works ([2,5,7,11,12]),

    更新日期:2020-01-08
  • A construction of $ \mathbb{F}_2 $-linear cyclic, MDS codes
    Adv. Math. Commun. (IF 0.734) Pub Date : 2019-11-20
    Sara D. Cardell; Joan-Josep Climent; Daniel Panario; Brett Stevens

    In this paper we construct $ \mathbb{F}_2 $-linear codes over $ \mathbb{F}_{2}^{b} $ with length $ n $ and dimension $ n-r $ where $ n = rb $. These codes have good properties, namely cyclicity, low density parity-check matrices and maximum distance separation in some cases. For the construction, we consider an odd prime $ p $, let $ n = p-1 $ and utilize a partition of $ \mathbb{Z}_n $. Then we apply

    更新日期:2019-11-20
  • Isogeny formulas for Jacobi intersection and twisted hessian curves
    Adv. Math. Commun. (IF 0.734) Pub Date : 2019-11-20
    João Paulo da Silva; Julio López; Ricardo Dahab

    The security of public-key systems is based on the difficulty of solving certain mathematical problems. With the possible emergence of large-scale quantum computers several of these problems, such as factoring and computing discrete logarithms, would be efficiently solved. Research on quantum-resistant public-key cryptography, also called post-quantum cryptography (PQC), has been productive in recent

    更新日期:2019-11-20
  • On polycyclic codes over a finite chain ring
    Adv. Math. Commun. (IF 0.734) Pub Date : 2019-09-04
    Alexandre Fotue-Tabue; Edgar Martínez-Moro; J. Thomas Blackford

    Galois images of polycyclic codes over a finite chain ring $ S $ and their annihilator dual are investigated. The case when a polycyclic code is Galois-disjoint over the ring $ S, $ is characterized and, the trace codes and restrictions of free polycyclic codes over $ S $ are also determined giving an analogue of Delsarte's theorem relating the trace code and the annihilator dual code.

    更新日期:2019-09-04
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
欢迎访问IOP中国网站
自然职场线上招聘会
GIANT
产业、创新与基础设施
自然科研线上培训服务
材料学研究精选
胸腔和胸部成像专题
屿渡论文,编辑服务
何川
苏昭铭
陈刚
姜涛
李闯创
李刚
北大
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
天合科研
x-mol收录
上海纽约大学
陈芬儿
厦门大学
何振宇
史大永
吉林大学
卓春祥
张昊
杨中悦
试剂库存
down
wechat
bug