中文
相关论文

相关论文: A Direct Construction of Optimal 2D-ZCACS with Fle…

200 篇论文

Ever-increasing amounts of data are created and processed in internet-scale companies such as Google, Facebook, and Amazon. The efficient storage of such copious amounts of data has thus become a fundamental and acute problem in modern…

信息论 · 计算机科学 2018-06-26 Natalia Silberstein , Tuvi Etzion , Moshe Schwartz

We initiate the study of Majorana fermion codes. These codes can be viewed as extensions of Kitaev's 1D model of unpaired Majorana fermions in quantum wires to higher spatial dimensions and interacting fermions. The purpose of Majorana…

量子物理 · 物理学 2014-11-20 Sergey Bravyi , Bernhard Leemhuis , Barbara M. Terhal

The explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Yet, the codes being deployed in practice are fairly short. In this work, we address what we…

信息论 · 计算机科学 2016-09-22 Parikshit Gopalan , Guangda Hu , Swastik Kopparty , Shubhangi Saraf , Carol Wang , Sergey Yekhanin

Fractional repetition (FR) codes is a family of codes for distributed storage systems (DSS) that allow uncoded exact repairs with minimum repair bandwidth. In this work, we consider a bound on the maximum amount of data that can be stored…

信息论 · 计算机科学 2015-01-22 Natalia Silberstein , Tuvi Etzion

We consider the locality of encoding and decoding operations in distributed storage systems (DSS), and propose a new class of codes, called locally encodable and decodable codes (LEDC), that provides a higher degree of operational locality…

信息论 · 计算机科学 2015-04-21 Son Hoang Dau , Han Mao Kiah , Wentu Song , Chau Yuen

Fractional repetition (FR) codes is a family of codes for distributed storage systems that allow for uncoded exact repairs having the minimum repair bandwidth. However, in contrast to minimum bandwidth regenerating (MBR) codes, where a…

信息论 · 计算机科学 2015-01-22 Natalia Silberstein , Tuvi Etzion

The beamforming optimization in continuous aperture array (CAPA)-based multi-user communications is studied. In contrast to conventional spatially discrete antenna arrays, CAPAs can exploit the full spatial degrees of freedom (DoFs) by…

信息论 · 计算机科学 2025-06-13 Zhaolin Wang , Chongjun Ouyang , Yuanwei Liu

Most multi-dimensional (more than two dimensions) lattice partitions only form additive quotient groups and lack multiplication operations. This prevents us from constructing lattice codes based on multi-dimensional lattice partitions…

信息论 · 计算机科学 2017-10-05 Min Qiu , Lei Yang , Yixuan Xie , Jinhong Yuan

Multi-dimensional arrays are ubiquitous in high-performance computing (HPC), but their absence from the C++ language standard is a long-standing and well-known limitation of their use for HPC. This paper describes the design and…

分布式、并行与集群计算 · 计算机科学 2020-10-14 D. S. Hollman , Bryce Adelstein Lelbach , H. Carter Edwards , Mark Hoemmen , Daniel Sunderland , Christian R. Trott

Multifocal laser direct writing (LDW) based on phase-only spatial light modulator (SLM) can realize flexible and parallel nanofabrication with high throughput potential. In this investigation, a novel approach of combining two-photon…

仪器与探测器 · 物理学 2023-10-10 Linhan Duan , Yueqiang Zhu , Haoxin Bai , Chen Zhang , Kaige Wang , Jintao Bai , Wei Zhao

Zero-suppressed Binary Decision Diagrams (ZDDs) are data structures for representing set families in a compressed form. With ZDDs, many valuable operations on set families can be done in time polynomial in ZDD size. In some cases, however,…

数据结构与算法 · 计算机科学 2020-04-10 Kotaro Matsuda , Shuhei Denzumi , Kunihiko Sadakane

MDS array codes are widely used in storage systems to protect data against erasures. We address the \emph{rebuilding ratio} problem, namely, in the case of erasures, what is the fraction of the remaining information that needs to be…

信息论 · 计算机科学 2016-11-17 Itzhak Tamo , Zhiying Wang , Jehoshua Bruck

Binary maximum distance separable (MDS) array codes are a special class of erasure codes for distributed storage that not only provide fault tolerance with minimum storage redundancy but also achieve low computational complexity. They are…

信息论 · 计算机科学 2019-06-24 Hanxu Hou , Yunghsiang Han , Patrick P. C. Lee , Yuchong Hu , Hui Li

The distance-3 cyclic lowest-density MDS array code (called the C-Code) is a good candidate for RAID 6 because of its optimal storage efficiency, optimal update complexity, optimal length, and cyclic symmetry. In this paper, the underlying…

信息论 · 计算机科学 2015-03-19 Mingqiang Li , Jiwu Shu

One of the important applications of Golay complementary sets (GCSs) is the reduction of peak-to-mean envelope power ratio (PMEPR) in orthogonal frequency division multiplexing (OFDM) systems. OFDM has played a major role in modern wireless…

信息论 · 计算机科学 2025-01-06 Abhishek Roy , Sudhan Majhi , Subhabrata Paul

Locally repairable codes (LRCs), which can recover any symbol of a codeword by reading only a small number of other symbols, have been widely used in real-world distributed storage systems, such as Microsoft Azure Storage and Ceph Storage…

信息论 · 计算机科学 2023-10-17 Wenqin Zhang , Deng Tang , Chenhao Ying , Yuan Luo

We develop sparse array receive beamformer design methods achieving maximum signal-to-interference plus noise ratio (MaxSINR) for wideband sources and jammers. Both tapped delay line (TDL) filtering and the DFT realizations to wideband…

信号处理 · 电气工程与系统科学 2020-11-16 Syed A. Hamza , Moeness Amin

The use of the millimeter (mm) wave spectrum for next generation (5G) mobile communication has gained significant attention recently. The small carrier wavelengths at mmwave frequencies enable synthesis of compact antenna arrays, providing…

信息论 · 计算机科学 2014-10-22 Jaspreet Singh , Sudhir Ramakrishna

The optimal branch number of MDS matrices makes them a preferred choice for designing diffusion layers in many block ciphers and hash functions. Consequently, various methods have been proposed for designing MDS matrices, including search…

信息论 · 计算机科学 2026-04-10 Kishan Chand Gupta , Sumit Kumar Pandey , Susanta Samanta

An optimal constant-composition or constant-weight code of weight $w$ has linear size if and only if its distance $d$ is at least $2w-1$. When $d\geq 2w$, the determination of the exact size of such a constant-composition or constant-weight…

信息论 · 计算机科学 2010-08-11 Yeow Meng Chee , Son Hoang Dau , Alan C. H. Ling , San Ling