检索结果-内蒙古大学图书馆

航海技术 2023年第4期 20-24页

作者：李明耿涛中远海运特种运输股份有限公司

装载在船舶上的重大件设备,在受到因船舶运动而产生的惯性力、风作用力和波溅力等外力影响,容易发生移动、倾倒、衬垫材料失效、船体局部变形等情况。为了确保海上运输货物安全,详细计算评估货物在外力作用下的支反力至关重要。2021年... 详细信息

装载在船舶上的重大件设备,在受到因船舶运动而产生的惯性力、风作用力和波溅力等外力影响,容易发生移动、倾倒、衬垫材料失效、船体局部变形等情况。为了确保海上运输货物安全,详细计算评估货物在外力作用下的支反力至关重要。2021年国际海事组织发布的《货物堆装和系固安全操作规则(css code)修订案》是结合当前海上运输行业最新货运技术和相关专家意见更新的技术文件,它对海上货运系固安全具有重要指导意义。先解读2021年国际海事组织发布的《货物堆装和系固安全操作规则(css code)修订案》在重大件系固方面的新增内容,再结合新增内容详细推导货物支反力的计算方法。

关键词： css code 重大件支反力

来源：评论

学校读者我要写书评

暂无评论

中国港监执行SOLAS公约(94)修正案及《货物积载和系固安全操作规则》(css code)研讨会在大连召开

引用

交通企业管理 1996年第5期 46-46页

作者：杨洪辉

3月28日至29日,交通部安全监督局在大连召开了“中国港监执行SDLAS公约(94)修正案及《货物积载和系固安全操作规则》(css code)研讨会”,包括各海监局主管监督长在内共20个单位的36名代表出席了会议,会议由部安监局黄何处长主持。部安

关键词：系固港监 css code 货物积载船舶积载大连辽宁研讨会 SOLAS 中华人民共和国

来源：评论

学校读者我要写书评

暂无评论

Bounds and Constructions of Quantum Locally Recoverable codes From Quantum css codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2025年第3期71卷 1794-1802页

作者： Luo, Gaojun Chen, Bocong Ezerman, Martianus Frederic Ling, San Nanjing Univ Aeronaut & Astronaut Sch Math Nanjing 211106 Jiangsu Peoples R China Nanyang Technol Univ Sch Phys & Math Sci Singapore 637371 Singapore South China Univ Technol Sch Future Technol Guangzhou 510641 Peoples R China PQStn Singapore 408564 Singapore

Classical locally recoverable codes (LRCs) have become indispensable in distributed storage systems. They provide efficient recovery in terms of localized errors. Quantum LRCs have very recently been introduced for their potential application in quantum data storage. In this paper, we use classical LRCs to investigate quantum LRCs. We prove that the parameters of quantum LRCs are bounded by their classical counterparts. We deduce bounds on the parameters of quantum LRCs from bounds on the parameters of the classical ones. We establish a characterization of optimal pure quantum LRCs based on classical codes with specific properties. Using well-crafted classical LRCs as ingredients in the construction of quantum css codes, we offer the first construction of several families of optimal pure quantum LRCs.

关键词： codes Linear codes Systematics Symbols Parity check codes Memory Hamming weight Finite element analysis codecs Vectors css code locally recoverable code quantum code

来源：评论

学校读者我要写书评

暂无评论

A new approach to constructing css codes based on factor graphs

引用

INFORMATION SCIENCES 2008年第7期178卷 1893-1902页

作者： Wang, Huisong Wang, Jun Du, Qun Zeng, Guihua Shanghai Jiao Tong Univ Dept Elect Engn State Key Lab FiberOpt Local Area Networks & Adv Shanghai 200030 Peoples R China Cent Architectural Design Inst Wuhan 430071 Peoples R China

A novel, practical and convenient approach to constructing Calderbank-Shor Steane (css) codes based on factor graphs is presented in this paper. Our proposed method is applied to solve two problems associated with constructing CCS codes. One is judging whether a code is a weakly self-dual code or not, the other is finding the generator matrix and parity-check matrix of a weakly self-dual code. The novelty, practicality and convenience of the approach are shown as follows. First, the approach is a hitherto unexplored one to constructing css codes. Second, the judgment of a weakly self-dual code is entirely based on factor graphs. Namely, we consider a code a weakly self-dual one when the Tanner graph or convolutional factor graph of its dual code can be obtained by that of its own via our proposed transform TR-->L. Finally, we can obtain the generator matrix and parity-check Matrix of a weakly self-dual code via factor graphs other than conventional algebra methods, which allow us avoid matrix Computation to get them. An example is given to show how to construct quantum css code based on factor graphs. The method can be extended to other css codes. (C) 2007 Elsevier Inc. All rights reserved.

关键词： quantum error-correcting code css code factor graph duality

来源：评论

学校读者我要写书评

暂无评论

The security analysis of the BB84 protocol in the case of Calderbank-Shor-Steane code leakage

引用

INTERNATIONAL JOURNAL OF QUANTUM INFORMATION 2022年第3期20卷 2150042-2150042页

作者： Fang, Ming Li, Ya-Ping Fei, Li Beijing Comp Res Ctr Beijing 100000 Peoples R China Wuhan Maritime Commun Res Inst Wuhan 430205 Peoples R China Huazhong Univ Sci & Technol Wuhan 430205 Peoples R China

Quantum key distribution (QKD) allows authenticated parties to share secure keys. Its security comes from quantum physics rather than computational complexity. The previous work has been able to demonstrate the security of the BB84 protocol based on the uncertainty principle, entanglement purification and information theory. In the security proof method based on entanglement purification, it is assumed that the information of Calderbank-Shor-Steane (css) error correction code cannot be leaked, otherwise, it is insecure. However, there is no quantitative analysis of the relationship between the parameter of css code and the amount of information leaked. In the attack and defense strategy of the actual quantum key distribution system, especially in the application of the device that is easy to lose or out of control, it is necessary to assess the impact of the parameter leakage. In this paper, we derive the relationship between the leaked parameter of css code and the amount of the final key leakage based on the BB84 protocol. Based on this formula, we simulated the impact of different css code parameter leaks on the final key amount. Through the analysis of simulation results, the security of the BB84 protocol is inversely proportional to the value of n - k(1) and k(1) - k(2) in the case of the css code leak.

关键词： Quantum key distribution css code security analysis

来源：评论

学校读者我要写书评

暂无评论

Secure Quantum Network code Without Classical Communication

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2020年第2期66卷 1178-1192页

作者： Song, Seunghoan Hayashi, Masahito Nagoya Univ Grad Sch Math Nagoya Aichi 4648601 Japan Southern Univ Sci & Technol Shenzhen Inst Quantum Sci & Engn Shenzhen 518055 Peoples R China Natl Univ Singapore Ctr Quantum Technol Singapore 119077 Singapore

We consider the secure quantum communication over a network with the presence of a malicious adversary who can eavesdrop and contaminate the states. The network consists of noiseless quantum channels with the unit capacity and the nodes which applies noiseless quantum operations. As the main result, when the maximum number $m_code$ of the attacked channels over the entire network uses is less than a half of the network transmission rate $m_code$ (i.e., $m_code < m_code/2$ ), our code implements secret and correctable quantum communication of the rate $m_code-2m_code$ by using the network asymptotic number of times. Our code is universal in the sense that the code is constructed without the knowledge of the specific node operations and the network topology, but instead, every node operation is constrained to the application of an invertible matrix to the basis states. Moreover, our code requires no classical communication. Our code can be thought of as a generalization of the quantum secret sharing.

关键词： Network topology Cryptography Error probability Knowledge engineering Quantum communication Encoding Quantum network code quantum error-correction css code universal construction malicious adversary

来源：评论

学校读者我要写书评

暂无评论

Quantum quasi-cyclic low-density parity-check error-correcting codes

引用

Chinese Physics B 2009年第10期18卷 4154-4160页

作者：李渊曾贵华 Moon Ho Leeb Laboratory of Coding and Communication Security Department of Electronic Engineering Shanghai Jiaotong University Institute of Information & Communication Department of Information & Communication EngineeringChonbuk National University

In this paper, we propose the approach of employing circulant permutation matrices to construct quantum quasicyclic （QC） low-density parity-check （LDPC） codes. Using the proposed approach one may construct some new quantum codes with various lengths and rates of no cycles-length 4 in their Tanner graphs. In addition, these constructed codes have the advantages of simple implementation and low-complexity encoding. Finally, the decoding approach for the proposed quantum QC LDPC is investigated.

关键词： quantum LDPC code quasi-cycliC circulant permutation matrix css code

来源：评论

学校读者我要写书评

暂无评论

Quantum private comparison over noisy channels

引用

QUANTUM INFORMATION PROCESSING 2015年第8期14卷 3005-3017页

作者： Siddhu, Vikesh Arvind IISER Dept Phys Sci Ajitgarh 140306 Punjab India Carnegie Mellon Univ Dept Phys Pittsburgh PA 15213 USA

Quantum private comparison (QPC) allows us to protect private information during its comparison. In the past, various three-party quantum protocols have been proposed that claim to work well under noisy conditions. Here, we tackle the problem of QPC under noise. We analyze the EPR-based protocol under depolarizing noise, bit flip and phase flip noise. We show how noise affects the robustness of the EPR-based protocol. We then present a straightforward protocol based on css codes to perform QPC which is robust against noise and secure under general attacks.

关键词： Quantum cryptography Quantum private comparison Noisy channels css code

来源：评论

学校读者我要写书评

暂无评论

Quantum LDPC codes With Almost Linear Minimum Distance

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2022年第1期68卷 213-229页

作者： Panteleev, Pavel Kalachev, Gleb Moscow MV Lomonosov State Univ Fac Mech & Math Moscow 119991 Russia

We give a construction of quantum LDPC codes of dimension Theta(logN) and distance Theta(N/logN) as the code length N -> infinity. Using a product of chain complexes this construction also provides a family of quantum LDPC codes of distance Omega(N1-alpha/2/logN) and dimension Omega(N-alpha logN), where 0 <= alpha < 1. We also introduce and study a new operation called lifted product, which naturally generalizes the product operations for quantum codes and chain complexes. Moreover, as a simple byproduct of our results on quantum codes, we obtain a new result on classical codes. We show that for any fixedR < 1 there exists an asymptotically good family of classical quasi-cyclic LDPC codes of rate at least R with, in some sense, optimal circulant size Omega(N/logN) as the code length N -> infinity.

关键词： css code quantum LDPC quasi-cyclic (QC) LDPC hypergraph product code chain complex

来源：评论

学校读者我要写书评

暂无评论

Structure of css and css-T quantum codes

引用

DESIGNS codeS AND CRYPTOGRAPHY 2024年第10期92卷 2801-2823页

作者： Berardini, Elena Caminata, Alessio Ravagnani, Alberto CNRS 351 Cours Liberat F-33405 Talence France Univ Bordeaux IMB 351 Cours Liberat F-33405 Talence France Univ Genoa Dipartimento Matemat Dipartimento Eccellenza 2023 2027 Via Dodecaneso 35 I-16146 Genoa Italy Eindhoven Univ Technol Eindhoven Netherlands

We investigate css and css-T quantum error-correcting codes from the point of view of their existence, rarity, and performance. We give a lower bound on the number of pairs of linear codes that give rise to a css code with good correction capability, showing that such pairs are easy to produce with a randomized construction. We then prove that css-T codes exhibit the opposite behaviour, showing also that, under very natural assumptions, their rate and relative distance cannot be simultaneously large. This partially answers an open question on the feasible parameters of css-T codes. We conclude with a simple construction of css-T codes from Hermitian curves. The paper also offers a concise introduction to css and css-T codes from the point of view of classical coding theory.

关键词： Quantum error-correcting code css code css-T code code parameters

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：