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

International Radar Symposium

作者： Hiroshi Takase Nobuaki Abe Masanori Shinriki Nippon Institute of Technology

ISBN: (纸本)9781467348218

Periodic binary codes, which are compressed to a signal with a width of several subpulses and small sidelobes, are searched using simulated annealing and hill climbing methods, because they can not be found by exhaustive searches. We found new codes with lengths of 53 and 55 and that the peak-sidelobe to peak-mainlobe ratios are smaller than such conventional codes as M-sequences.

关键词： Climbing simulated annealing binary code COMPRESSED subpulse exhaustive search Periodic Searches m-sequences codes

来源：评论

学校读者我要写书评

暂无评论

All-optical graphene-based plasmonic binary to gray code converter

引用

OPTICAL AND QUANTUM ELECTRONICS 2022年第3期54卷 142-142页

作者： Abbasi, Mahmoud Sadeghi, Mojtaba Adelpour, Zahra Islamic Azad Univ Dept Elect Engn Shiraz Branch Shiraz Iran

In this paper, a binary to gray code converter based on graphene-plasmonic waveguides using the interference effect is proposed. The plasmonic waveguides are made of graphene nano-ribbons located on the dielectric layer. The use of graphene leads to high confinement of light, relatively low losses, and working in the mid-infrared to THz region. Based on the proposed structure, two-bit and three-bit binary to gray code converters are designed and their performance is evaluated using the finite-difference time-domain (FDTD) method. The calculated values of extinction ratio (ER) for two-bit converter are 7.22 dB and 14.83 dB for G0 and G1 bits and 8.82 dB, 5.72 dB, and 11.27 dB for G0, G1, and G2 bits in the three-bit converter. Time responses indicate the high performance of the proposed converters. Moreover, the dimensions of the two-bit and three-bit structures are 2.6 mu m(2) and 4 mu m(2), respectively, representing the high potential of these devices for use in integrated photonic systems. It is worthy to note that the converters with more bits can also be implemented using the proposed structure.

关键词： binary code Gray code Interference effect Optical converter Plasmonic waveguide

来源：评论

学校读者我要写书评

暂无评论

On the use of binary and gray code schemes for continuous-tone picture representation

引用

Pattern Recognition 1973年第2期5卷 121-128,IN5-IN12,129-132页

作者： Deutsch, E.S. Computer Science Center University of Maryland College Park MD 20742 United States

The paper discusses the idea of iterating the conversion of a continuous-tone picture from binary to Gray code representation. A simple recursive function is defined by means of which the value of the ith bit representing a picture point's grey level after the mth iteration is determined. The resulting rearrangement of grey levels as well as that of the bits throughout the planes is discussed next. The iteration is shown to repeat after 2″ steps, where n is the number of bit planes representing the picture. A data compression scheme is developed on the basis that prior to exact repetition, approximate repetitions take place during the iterations, and the resulting picture is almost the same as the original. © 1973.

关键词： binary code Picture compression Unit distance code

来源：评论

学校读者我要写书评

暂无评论

Detection Optimization of Brute-Force Cyberattack Using Modified Caesar Cipher Algorithm Based on binary codes (MCBC)

引用

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2025年第3期16卷 523-530页

作者： Tahboush, Muhannad Hamdan, Adel Klaib, Mohammad Adawy, Mohammad Alzobi, Firas World Islamic Sci & Educ Univ Informat Syst & Network Dept Amman Jordan World Islamic Sci & Educ Univ Comp Sci Dept Amman Jordan Middle East Univ Intelligent Syst Engn Dept Amman Jordan

security is considered vital aspects that are employed to protect user credentials and digital information from cyber security threats. A Caesar cipher is an ancient cryptography algorithm, and it is susceptible to being easily broken and vulnerable to brute-force attack. Brute-force attack is a cyberattack that uses trial and error to crack passwords, login credentials, and encryption keys to unauthorized access and illegal to a system and individual accounts. However, several research has been developed to defeat the existing vulnerabilities in Caesar cipher, but are still suffering from their limitations and failing to provide a high level of attack detection and encryption strength. Therefore, Modified Caesar Cipher Algorithm Based on binary codes (MCBC) has been proposed to mitigate brute-force attack more optimistically based on different scenarios. First scenario, converting message to binary numbering system and the second scenario, employ binary shifting technique and then convert it to hexadecimal code. The performance metrics that were taken into consideration to evaluate the MCBC proposed algorithm are detection rate, strength rate, true positive rate and time required for decryption. The experimental results show that the proposed approach MCBC performance metrics outperformed other algorithms against brute force attack by ensuring the confidentiality of information.

关键词： Brute-force attack encryption Caesar cipher binary code security

来源：评论

学校读者我要写书评

暂无评论

Homogenization of binary linear codes and their applications

引用

FINITE FIELDS AND THEIR APPLICATIONS 2025年 103卷

作者： Hyun, Jong Yoon Mondal, Nilay Kumar Lee, Yoonjin Konkuk Univ Glocal Campus268 Chungwon Daero Chungju Si 27478 Chungcheongbuk South Korea Ewha Womans Univ Inst Math Sci Seoul 03760 South Korea Ewha Womans Univ Dept Math Seoul 03760 South Korea

We introduce a new technique, called homogenization, for a systematic construction of augmented codes of binary linear codes, using the defining set approach in connection to multivariable functions. We explicitly determine the parameters and the weight distribution of the homogenized codes when the defining set is either a simplicial complex generated by any finite number of elements, or the difference of two simplicial complexes, each of which is generated by a single maximal element. Using this homogenization technique, we produce several infinite families of optimal codes, self-orthogonal codes, minimal codes, and self-complementary codes. As applications, we obtain some best known quantum errorcorrecting codes, infinite families of intersecting codes (used in the construction of covering arrays), and we compute the Trellis complexity (required for decoding) for several families of codes as well. (c) 2025 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.

关键词： Homogenization Multi-variable function Simplicial complex Optimal code binary code

来源：评论

学校读者我要写书评

暂无评论

AOIFF: A Precise Attack Method for PLCs Based on Awareness of Industrial Field Information

IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING

引用

IEEE TRANSACTIONS ON SUSTAINABLE COMPUTING 2025年第2期10卷 232-243页

作者： Yao, Wenjun Sun, Yanbin Wu, Guodong Fang, Binxing Liu, Yuan Tian, Zhihong Guangzhou Univ Cyberspace Inst Adv Technol Guangzhou 510006 Peoples R China

PLC, as the core of industrial control systems, has been turned into a focal point of research for attackers targeting industrial control systems. However, current researched methods for attacking PLCs suffer from issues such as lack of precision and limited specificity. This paper proposes a novel attack method called AOIFF. Specially, AOIFF extracts the binary control logic code from a running PLC and reverses the binary code into assemble code. And then awareness of industrial field information is extracted from assemble code. Finally, it is based on awareness that attack code is generated and injected into a PLC, which can disrupt the normal control logic and then launch precise attacks on industrial control systems. Experimental results demonstrate that AOIFF can effectively perceive information in industrial field and initiate precise and targeted attacks on industrial control systems. Additionally, AOIFF achieves excellent results in the reverse engineering of binary code, enabling effective analysis of binary code.

关键词： Logic binary codes Control systems Process control Reverse engineering Cyberspace Assembly Attack method binary code industrial control system reverse engineering scene awareness

来源：评论

学校读者我要写书评

暂无评论

Variety of mutual-visibility problems in hypercubes

引用

APPLIED MATHEMATICS AND COMPUTATION 2025年 491卷

作者： Korze, Danilo Vesel, Aleksander Univ Maribor Fac Elect Engn & Comp Sci Koroska Cesta 46 SI-2000 Maribor Slovenia Univ Maribor Fac Nat Sci & Math Koroska Cesta 160 SI-2000 Maribor Slovenia

Let G be a graph and M c V(G). Vertices x, y E Mare M-visible if there exists a shortest x, y-path of G that does not pass through any vertex of M \ {x,y}. We say that M is a mutual-visibility set if each pair of vertices of M is M-visible, while the size of any largest mutual-visibility set of G is the mutual-visibility number of G. If some additional combinations for pairs of vertices x, y are required to be M-visible, we obtain the total (every x, y E V(G) are M-visible), the outer (every x E M and every y E V(G) \ M are M-visible), and the dual (every x, y E V(G) \ M are M-visible) mutual-visibility set of G. The cardinalities of the largest of the above defined sets are known as the total, the outer, and the dual mutual-visibility number of G, respectively. We present results on the variety of mutual-visibility problems in hypercubes.

关键词： Mutual visibility Hypercube binary code

来源：评论

学校读者我要写书评

暂无评论

binary codes of odd-order nets

引用

DESIGNS codeS AND CRYPTOGRAPHY 1999年第1-3期17卷 15-36页

作者： Assmus, EF Drisko, AA Lehigh Univ Dept Math Bethlehem PA 18015 USA Natl Secur Agcy Ft George G Meade MD 20755 USA

来源：评论

学校读者我要写书评

暂无评论

binary codes storage and data encryption in substrates with single proton beam writing technology

引用

NUCLEAR INSTRUMENTS & METHODS IN PHYSICS RESEARCH SECTION B-BEAM INTERACTIONS WITH MATERIALS AND ATOMS 2006年第1期248卷 54-58页

作者： Zhang, Jun Zhan, Fu-Ru Hu, Zhi-Wen Chen, Lian-Yun Yu, Zeng-Liang Acad Sinica Inst Plasma Phys Key Lab Ion Beam Bioengn Hefei 230031 Anhui Peoples R China

It has been demonstrated that characters can be written by proton beams in various materials. In contributing to the rapid development of proton beam writing technology, we introduce a new method for binary code storage and data encryption by writing binary codes of characters (BCC) in substrates with single proton beam writing technology. In this study, two kinds of BCC (ASCII BCC and long bit encrypted BCC) were written in CR-39 by a 2.6 MeV single proton beam. Our results show that in comparison to directly writing character shapes, writing ASCII BCC turned out to be about six times faster and required about one fourth the area in substrates. The approach of writing long bit encrypted BCC by single proton beams supports preserving confidential information in substrates. Additionally, binary codes fabricated by MeV single proton beams in substrates are more robust than those formed by lasers, since MeV single proton beams can make much deeper pits in the substrates. (c) 2006 Elsevier B.V. All rights reserved.

关键词： single ion binary code preservation lithography microbeam

来源：评论

学校读者我要写书评

暂无评论

binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs Γ(2k, k, k+1, 1)

引用

QUAESTIONES MATHEMATICAE 2020年第4期43卷 523-538页

作者： Fish, W. Mumba, N. B. Mwambene, E. Rodrigues, B. G. Univ Western Cape Dept Math & Appl Math Private Bag X17 Bellville 7535 South Africa Mzuzu Univ Dept Math & Stat Private Bag 201 Mzuzu Malawi Univ KwaZulu Natal Sch Math Stat & Comp Sci Durban 4041 South Africa

For a set omega = {1, 2, . . . , n} where n = 2k >= 6, let omega({k}) denote the set of all subsets of omega of size k. We examine the binary codes from the row span of biadjacency matrices of bipartite graphs with bipartition (omega({k}), omega({k)(+1)(})) and two vertices as k-subsets and (k+1)-subsets of omega being adjacent if they have one element in common. We show that S2k is contained in the automorphism group of the graphs and the codes, respectively. In addition, we determine the duals of the codes, and by identifying suitable information sets, we construct 2-PD sets for the dual codes.

关键词： 05Axx 05Bxx 05Cxx 15Bxx Biadjacency matrix binary code bipartite graphs permutation decoding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：