Maximum distance separable codes in the ρ metric over arbitrary alphabets

被引：0
|
作者：
Dougherty, Steven T.
Skriganov, Maxim M.
机构：
来源：
| 1600年 / Kluwer Academic Publishers卷 / 16期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [41] Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes
    Kumar, Siddhartha
    Lin, Hsuan-Yin
    Rosnes, Eirik
    Graell i Amat, Alexandre
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (07) : 4243 - 4273
  • [42] THROUGHPUT EVALUATION OF MULTICAST ERROR CONTROL SCHEMES WITH MAXIMUM DISTANCE SEPARABLE CODES
    SAKAKIBARA, K
    KASAHARA, M
    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS, 1995, 78 (08): : 46 - 56
  • [43] Maximum distance codes over rings of order 4
    Dougherty, ST
    Shiromoto, K
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (01) : 400 - 404
  • [44] Maximum distance separable codes over Z4 and Z2 x Z4
    Bilal, M.
    Borges, J.
    Dougherty, S. T.
    Fernandez-Cordoba, C.
    DESIGNS CODES AND CRYPTOGRAPHY, 2011, 61 (01) : 31 - 40
  • [45] Parallel Concatenation of Non-Binary Linear Random Fountain Codes with Maximum Distance Separable Codes
    Blasco, Francisco Lazaro
    Garrammone, Giuliano
    Liva, Gianluigi
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2013, 61 (10) : 4067 - 4075
  • [46] LDPC codes over mixed alphabets
    Ng, K. S.
    Armand, M. A.
    ELECTRONICS LETTERS, 2006, 42 (22) : 1290 - 1292
  • [47] Quantum generalized Reed-Solomon codes: Unified framework for quantum maximum-distance-separable codes
    Li, Zhuo
    Xing, Li-Juan
    Wang, Xin-Mei
    PHYSICAL REVIEW A, 2008, 77 (01)
  • [48] Note on maximal distance separable codes
    杨建生
    王德秀
    靳庆芳
    Journal of Shanghai University(English Edition), 2009, 13 (05) : 409 - 411
  • [49] CHAIN CODES WITH ARBITRARY DISTANCE
    EVDOKIMOV, AA
    DOKLADY AKADEMII NAUK SSSR, 1976, 228 (06): : 1273 - 1276
  • [50] On Galois LCD codes and LCPs of codes over mixed alphabets
    Jose, Leijo
    Sharma, Anuradha
    DISCRETE MATHEMATICS, 2025, 348 (08)
12345