咨询与建议

限定检索结果

文献类型

  • 7 篇 期刊文献
  • 3 篇 会议

馆藏范围

  • 10 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 10 篇 工学
    • 8 篇 计算机科学与技术...
    • 6 篇 电气工程
    • 3 篇 电子科学与技术(可...
    • 3 篇 信息与通信工程
    • 1 篇 控制科学与工程
    • 1 篇 软件工程
  • 3 篇 理学
    • 3 篇 数学

主题

  • 10 篇 random linear co...
  • 1 篇 mobility-assiste...
  • 1 篇 concatenated cod...
  • 1 篇 gilbert-varshamo...
  • 1 篇 image steganogra...
  • 1 篇 parallelism
  • 1 篇 bilinear complex...
  • 1 篇 attribute-effici...
  • 1 篇 matrix analysis
  • 1 篇 dnf
  • 1 篇 information set ...
  • 1 篇 pipelining
  • 1 篇 generalized mini...
  • 1 篇 parity function
  • 1 篇 gossips
  • 1 篇 code-based crypt...
  • 1 篇 matrix embedding
  • 1 篇 soft-decision al...
  • 1 篇 componentwise pr...
  • 1 篇 non-adaptive

机构

  • 1 篇 shanghai univ sc...
  • 1 篇 yonsei univ sch ...
  • 1 篇 enst telecom par...
  • 1 篇 georgia tech dep...
  • 1 篇 univ amsterdam i...
  • 1 篇 univ alberta dep...
  • 1 篇 hebrew univ jeru...
  • 1 篇 univ maryland co...
  • 1 篇 hongik univ dept...
  • 1 篇 emc corp edmonto...
  • 1 篇 harvard univ sch...
  • 1 篇 shanghai jiao to...
  • 1 篇 univ calif los a...
  • 1 篇 univ fukui fac e...
  • 1 篇 cnrs ltci umr 51...

作者

  • 1 篇 mao qian
  • 1 篇 yuan chen
  • 1 篇 barg a
  • 1 篇 feldman vitaly
  • 1 篇 mcgregor a
  • 1 篇 liu yan
  • 1 篇 huang han
  • 1 篇 niu di
  • 1 篇 hirose shoichi
  • 1 篇 ro won w.
  • 1 篇 randriambololona...
  • 1 篇 park joon-sang
  • 1 篇 gerla mario
  • 1 篇 resch nicolas
  • 1 篇 mosheiff jonatha...
  • 1 篇 khabbazian majid
  • 1 篇 pau giovanni
  • 1 篇 hao jing
  • 1 篇 livshyts galyna ...
  • 1 篇 lee seung-hoon

语言

  • 10 篇 英文
检索条件"主题词=Random linear code"
10 条 记 录,以下是1-10 订阅
排序:
Distribution of the Minimum Distance of random linear codes
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2022年 第10期68卷 6388-6401页
作者: Hao, Jing Huang, Han Livshyts, Galyna, V Tikhomirov, Konstantin Georgia Tech Dept Math Atlanta GA 30332 USA
Let q >= 2 be a prime power. In this paper, we study the distribution of the minimum distance (in the Hamming metric) of a random linear code of dimension k in F-q(n). We provide quantitative estimates showing that... 详细信息
来源: 评论
A fast algorithm for matrix embedding steganography
收藏 引用
DIGITAL SIGNAL PROCESSING 2014年 第0期25卷 248-254页
作者: Mao, Qian Shanghai Univ Sci & Technol Sch Opt Elect & Comp Engn Shanghai 200093 Peoples R China
A fast algorithm for matrix embedding steganography is proposed in this paper. Matrix embedding encodes the cover image and the secret message with an error correction code and modifies the cover image according to th... 详细信息
来源: 评论
Threshold Rates of code Ensembles: linear Is Best
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 2024年 第7期70卷 4823-4842页
作者: Resch, Nicolas Yuan, Chen Univ Amsterdam Informat Inst NL-1098XH Amsterdam Netherlands Shanghai Jiao Tong Univ Sch Elect Informat & Elect Engn Shanghai 200240 Peoples R China
In this work, we prove new results concerning the combinatorial properties of random linear codes. By applying the thresholds framework from Mosheiff et al. (FOCS 2020) we derive fine-grained results concerning the li... 详细信息
来源: 评论
Cooper: Expedite Batch Data Dissemination in Computer Clusters with coded Gossips
收藏 引用
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2017年 第8期28卷 2204-2217页
作者: Liu, Yan Niu, Di Khabbazian, Majid EMC Corp Edmonton AB T6H 5S4 Canada Univ Alberta Dept Elect & Comp Engn Edmonton AB T6H 5S4 Canada
Data transfers happen frequently in server clusters for software and application deployment, and in parallel computing clusters to transmit intermediate results in batches among servers between computation stages. Thi... 详细信息
来源: 评论
On the weight distribution of random binary linear codes
收藏 引用
random STRUCTURES & ALGORITHMS 2020年 第1期56卷 5-36页
作者: Linial, Nati Mosheiff, Jonathan Hebrew Univ Jerusalem Dept Comp Sci IL-9190401 Jerusalem Israel
We investigate the weight distribution of random binary linear codes. For 0 infinity pick uniformly at random lambda n vectors in F2n and let C <= F2n be the orthogonal complement of their span. Given 0 < gamma ... 详细信息
来源: 评论
Efficient Peer-to-Peer File Sharing Using Network Coding in MANET
收藏 引用
JOURNAL OF COMMUNICATIONS AND NETWORKS 2008年 第4期10卷 422-429页
作者: Lee, Uichin Park, Joon-Sang Lee, Seung-Hoon Ro, Won W. Pau, Giovanni Gerla, Mario Hongik Univ Dept Comp Engn Seoul South Korea Univ Calif Los Angeles Dept Comp Sci Los Angeles CA 90024 USA Yonsei Univ Sch Elect & Elect Engn Seoul 120749 South Korea
Mobile peer-to-peer (P2P) systems have recently got in the limelight of the research community that is striving to build efficient and effective mobile content addressable networks. Along this line of research, we pro... 详细信息
来源: 评论
linear independence of rank 1 matrices and the dimension of *-products of codes
Linear independence of rank 1 matrices and the dimension of ...
收藏 引用
IEEE International Symposium on Information Theory (ISIT)
作者: Randriambololona, Hugues ENST Telecom ParisTech 46 Rue Barrault F-75634 Paris 13 France CNRS LTCI UMR 5141 F-75634 Paris 13 France
We show that with high probability, random rank 1 matrices over a finite field are in (linearly) general position, at least provided their shape k x l is not excessively unbalanced. This translates into saying that th... 详细信息
来源: 评论
List decoding of concatenated codes: improved performance estimates
List decoding of concatenated codes: improved performance es...
收藏 引用
IEEE International Symposium on Information Theory
作者: Barg, A McGregor, A Univ Maryland College Pk MD 20742 USA
An improved bound is proved on the list-decoding radius of a concatenated code relying upon a combination of (soft-decision) algebraic list decoding and generalized minimum distance (GMD) decoding in the outer level. ... 详细信息
来源: 评论
May-Ozerov Algorithm for Nearest-Neighbor Problem over Fq and Its Application to Information Set Decoding  9th
May-Ozerov Algorithm for Nearest-Neighbor Problem over F<i><...
收藏 引用
9th International Conference on Security for Information Technology and Communications (SECITC)
作者: Hirose, Shoichi Univ Fukui Fac Engn Fukui Japan
May and Ozerov proposed an algorithm for the nearest-neighbor problem of vectors over the binary field at EUROCRYPT 2015. They applied their algorithm to the decoding problem of random linear codes over the binary fie... 详细信息
来源: 评论
Attribute-efficient and non-adaptive learning of parities and DNF expressions
收藏 引用
JOURNAL OF MACHINE LEARNING RESEARCH 2007年 8卷 1431-1460页
作者: Feldman, Vitaly Harvard Univ Sch Engn & Appl Sci Cambridge MA 02138 USA
We consider the problems of attribute-efficient PAC learning of two well-studied concept classes: parity functions and DNF expressions over {0,1}(n). We show that attribute-efficient learning of parities with respect ... 详细信息
来源: 评论