An Error-Correcting Code-Based Robust Watermarking Scheme for Stereolithographic Files

Stereolithographic(STL)files have been extensively used in rapid prototyping industries as well as many other fields as watermarking algorithms to secure intellectual property and protect three-dimensional models from theft.However,to the best of our knowledge,few studies have looked at how watermarking can resist attacks that involve vertex-reordering.Here,we present a lossless and robust watermarking scheme for STL files to protect against vertexreordering attacks.Specifically,we designed a novel error-correcting code(ECC)that can correct the error of any one-bit in a bitstream by inserting several check digits.In addition,ECC is designed to make use of redundant information according to the characteristics of STL files,which introduces further robustness for defense against attacks.No modifications are made to the geometric information of the three-dimensional model,which respects the requirements of a highprecision model.The experimental results show that the proposed watermarking scheme can survive numerous kinds of attack,including rotation,scaling and translation(RST),facet reordering,and vertex-reordering attacks.

USING ERROR-CORRECTING ENCODERS TO DESIGN LOCAL-RANDOM SEQUENCE GENERATORS

This paper proved the statement that a good linear block encoder is in fact a good local-random sequence generator. Furthermore, this statement discovers the deep relationship between the error-correcting coding theory and the modern cryptography.

Quantum secret sharing based on quantum error-correcting codes

Quantum secret sharing（QSS） is a procedure of sharing classical information or quantum information by using quantum states. This paper presents how to use a [2k- 1, 1, k] quantum error-correcting code （QECC） to implement a quantum （k, 2k-1） threshold scheme. It also takes advantage of classical enhancement of the [2k-1, 1, k] QECC to establish a QSS scheme which can share classical information and quantum information simultaneously. Because information is encoded into QECC, these schemes can prevent intercept-resend attacks and be implemented on some noisy channels.

Enhancement of Error-Correction Coding of Spatial Watermarks in Gray Code

This paper demonstrates how channel coding can improve the robustness of spatial image watermarks against signal distortion caused by lossy data compression such as the JPEG scheme by taking advantage of the properties of Gray code. Two error-correction coding (ECC) schemes are used here: One scheme, referred to as the vertical ECC (VECC), is to encode information bits in a pixel by error-correction coding where the Gray code is used to improve the performance. The other scheme, referred to as the horizontal ECC (HECC), is to encode information bits in an image plane. In watermarking, HECC generates a codeword representing watermark bits, and each bit of the codeword is encoded by VECC. Simple single-error-correcting block codes are used in VECC and HECC. Several experiments of these schemes were conducted on test images. The result demonstrates that the error-correcting performance of HECC just depends on that of VECC, and accordingly, HECC enhances the capability of VECC. Consequently, HECC with appropriate codes can achieve stronger robustness to JPEG—caused distortions than non-channel-coding watermarking schemes.

Spatial Image Watermarking by Error-Correction Coding in Gray Codes

In this paper, error-correction coding (ECC) in Gray codes is considered and its performance in the protecting of spatial image watermarks against lossy data compression is demonstrated. For this purpose, the differences between bit patterns of two Gray codewords are analyzed in detail. On the basis of the properties, a method for encoding watermark bits in the Gray codewords that represent signal levels by a single-error-correcting (SEC) code is developed, which is referred to as the Gray-ECC method in this paper. The two codewords of the SEC code corresponding to respective watermark bits are determined so as to minimize the expected amount of distortion caused by the watermark embedding. The stochastic analyses show that an error-correcting capacity of the Gray-ECC method is superior to that of the ECC in natural binary codes for changes in signal codewords. Experiments of the Gray-ECC method were conducted on 8-bit monochrome images to evaluate both the features of watermarked images and the performance of robustness for image distortion resulting from the JPEG DCT-baseline coding scheme. The results demonstrate that, compared with a conventional averaging-based method, the Gray-ECC method yields watermarked images with less amount of signal distortion and also makes the watermark comparably robust for lossy data compression.

Coding Scheme for Ka-Band Fixed Satellite Communication System

The performance analysis and simulation of coding schemes based on the modeling Ka band fixed satellite channel have been presented. The results indicate that concatenated codes with large inner interleaving depth have good performance and high spectrum efficiency. The studies also show that simple block interleaving is very effective in combating the slow frequency nonselective fading of Ka band.

A Novel Deterministic Quantum Communication Scheme Using Stabilizer Quantum Code

Exploiting the encoding process of the stabilizer quantum code [[n, k, d]], a deterministic quantum communication scheme, in which n - 1 photons are distributed forward and backward in two-way channel, is proposed to transmit the secret messages with unconditional security. The present scheme can be implemented to distribute the secret quantum （or classical） messages with great capacity in imperfect quantum channel since the utilized code encodes k-qubit messages for each scheme run.

Lifting Scheme Based SPIHT Still Image Coding

In order to eliminate float-point operations for fast wavelet transform, an integer D9/7 biorthogonal reversible wavelet transform was accomplished by lifting scheme. The lifting scheme based wavelet transform can be finished by addition and shift simply. It improved the quality of reconstructive image and greatly reduced the computational complexity due to integer operation. It is suitable for real-time image coding on hardware such as DSP. The simulation results show that the lifting scheme based SPIHT is prior to traditional wavelet based SPHIT in quality and complexity.

NEW SECRET SHARING SCHEME BASED ON LINEAR CODE

A secret sharing system can be damaged when the dealer cheating occurs.In this paper,two kinds of secret sharing schemes based on linear code are proposed.One is a verifiable scheme which each participant can verify his own share from dealer's distribution and ensure each participant to receive valid share.Another does not have a trusted center,here,each participant plays a dual-role as the dealer and shadow(or share) provider in the whole scheme.

A CODING SCHEME USING GLOBAL MOTION ESTIMATION FOR AVS P-FRAME

Block matching has been used for motion estimation and motion compensation in the Au- dio and Video Standard (AVS) for years. While having an acceptable performance in describing mo- tion between frames, it requires quite a few bits to represent the motion vectors. In certain circum- stances, the use of global motion estimation and compensation would perform equally well or even better than the block matching in terms of motion accuracy, while it results in the coding of global motion model parameters. In this letter, we modify an AVS coder by adding (1) six global motion model parameters to the frame header, and (2) mode selection among INTRA, SKIP, INTER-16×16, INTER-16×8, INTER-8×16, INTER-8×8, and Global Motion Compensation (GMC) modes by La- grange optimal rate-distortion criteria. Simulation results demonstrate that over 0.1dB improvement in PSNR is obtained compared to the AVS coder for an average coded P-frame with the same bit- rate.

Secret Sharing Schemes Based on the Dual Code of the Code of a Symmetric （v, k, λ）-Design and Minimal Access Sets

Secret sharing has been a subject of study for over 30 years. The coding theory has been an important role in the constructing of the secret sharing schemes. It is known that every linear code can be used to construct the secret sharing schemes. Since the code of a symmetric （V, k, λ）-design is a linear code, this study is about the secret sharing schemes based on C of Fp-code C of asymmetric （v, k, λ）-design.

A New Method to Construct Secret Sharing Schemes Based on Linear Codes

Secret sharing is an important topic in cryptography and has applications in information security. The coding theory has been an important role in the constructing of secret sharing schemes. It is known that every linear code can be used to construct secret sharing schemes. So, we use the parity-check matrix of a linear code to construct secret sharing schemes based on linear codes. We also describe some techniques to recover the secret and determine the access structure of the new scheme. In this paper, we use the Massey＇s secret sharing scheme.

融合多头自注意力的AeroMACS自适应调制编码算法

航空移动机场通信系统(AeroMACS)因传输速率高、安全性好等优点成为机场、空地通信网络的重要组成部分。针对飞机起飞、着陆高速移动阶段的信道快速时变导致信道状态信息(CSI)过时和多普勒频移大等引起通信质量恶化的问题,利用多头自注意力机制,提出了基于Transformer神经网络的信道预测方法。根据实时预测的信噪比(SNR)来调整AeroMACS的WiMAX和5G双模的调制编码方案(MCS)。仿真结果表明,与其他3种人工智能方法相比,所提出的基于Transformer网络的信道预测方法能够达到较高的准确率,并提升了系统的总吞吐量,对缓解信道参数过时现状和提高系统通信性能具有良好的促进作用。

基于重传错误率估计的自适应HARQ

自适应混合自动重传请求(hybrid automatic repeat request,HARQ)系统的性能与每次传输中的调制与编码方案(modulation and coding scheme,MCS)、发送功率选择密切相关,通过优化重传时的MCS及发送功率可以提升HARQ系统的吞吐率并降低能耗。由于不同MCS传输合并后的译码性能没有闭式解,这导致自适应HARQ优化问题不易解决。首先基于译码的判决域半径给出了一种HARQ合并后译码错误率的近似公式,进而提出了多种能权衡吞吐率和能耗性能的自适应HARQ优化策略。仿真结果验证了所提错误率估计方法的可靠性以及所提自适应HARQ的性能。与传统HARQ方案相比,所提方案能同时提高吞吐率、降低能耗,实现更好的吞吐率与能耗的性能折中。

中小型白酒企业产品追溯体系建设方案研究

产品追溯是指从原料、生产、仓储等各个环节,对产品信息进行详细记录,以实现对产品状态及流向的实时跟踪。建立完善的产品追溯体系,是政府监管部门对白酒生产企业的强制要求,同时也是企业自身生产经营的客观需要。该文以中小型白酒生产企业为研究对象,分析了当前追溯体系的现状,较系统的阐述了追溯体系的建立、信息传递及实施过程,重点介绍了一种适合于中小型白酒企业的追溯信息及规范化编码方法,可供相关企业借鉴。

Lifting Scheme及其在小波图象编码中的应用

L ifting Schem e是构造第二代小波的关键技术 .相对于第一代小波而言 ,L ifting Scheme是一种比 Mallat算法更快、更简单和更容易操作的算法 ,也是 JPEG2 0 0 0推荐的算法 .为了将其应用到小波图象编码中 ,提出了一种对 L ifting Scheme作适当改进以用于小波图象编码的方法 .该方法就是先用 L ifting Scheme来实现 D9/ 7双正交小波变换 ,然后再用这种技术实现的 D9/ 7双正交小波变换来进行图象压缩编码 .在将 L ifting Schem e算法用于小波图象编码的过程中 ,对该算法做了必要的简化 ,以便保证每个提升 (lifting)环节都是 FIR滤波 .同时 ,根据能量守恒的原则 ,重新调整了尺度因子 .实验结果表明 ,这种经过改进的 L ifting Schem e取得了比

由传统认证码(A-CODE)构造有仲裁人的认证码(A^2-CODE)

本文利用密钥分享方案,特别是(k,n)-门限方案和智力扑克协议作为工具,从目前所有的无仲裁人的认证码可以构造出安全高效的有仲裁人的认证码.分析表明,得到的新码可以抵抗来自各方(包括通信双方,敌方,仲裁人,以及某一方与某些仲裁人的合谋)的欺骗攻击,同时具有原码的所有优良性能。它的实现比较简单,为了抵抗来自仲裁人的攻击,只需增加一定的冗余度,所增加的冗余比特的多少随着安全度要求的变化而变化。

LTE-M车地无线通信系统中的自适应调制编码技术

城市轨道交通车地综合通信(LTEM)系统在通信环境、业务需求等方面与公共无线通信系统有较大的差异。传统的调制编码技术已无法满足系统性能要求。文章针对LTE-M应用场景的特殊性,提出了一种AMC技术的优化方案。经过测试证明,该方案解决了由于信号质量变化太快以及信号频繁抖动所带来的调制编码等级不准确问题,保证了在切换过程中的丢包率以及时延,大大提高了切换过程中的性能指标。

基于循环码的秘密共享方案

纠错码可以用来构造秘密共享方案,每个线性码均对应一个秘密共享方案.然而,一般情况下,基于线性码所得到的秘密共享方案的存取结构难以确定.循环码是线性码的一类非常重要的子码,由于其具有高效的编码和解码算法,循环码在数据存储系统、通信系统和消费者电子系统中有广泛应用.令p是一个奇素数,m是一个正整数.设α是F^(∗)_(p)m的一个生成元,0≤e1,e2,e3≤p^(m)-2,s=p^(m)-1/2.令C(e1,e2,e3)表示具有三个非零根α^(e1)、α^(e2)和α^(e3)的p元循环码.首先,本文通过分析有限域上某些多项式的根的个数,给出两类参数为[5m-1,5m-2m-2,4]的最优五元循环码C(0,e1,e2).其次,给出了循环码C(0,e1,e2)和C(s,e1+s,e2+s)之间的一个联系.该联系表明可以利用最优循环码C(0,1,e)来构造最优循环码C(1,e,s).最后,本文给出了一些基于五元循环码的秘密共享方案,结果表明所构造的秘密共享方案具有良好的存取结构.

Evil-hunter: a novel web shell detection system based on scoring scheme

In order to detect web shells that hackers inject into web servers by exploiting system vulnerabilities or web page open sources, a novel web shell detection system based on the scoring scheme is proposed, named Evil-hunter. First, a large set of malicious function samples normally used in web shells are collected from various sources on the Internet and security forums. Secondly, according to the danger level and the frequency of using these malicious functions in the web shells as well as in legal web applications, an assigning score strategy for each malicious sample is devised. Then, the appropriate score threshold value for each sample is obtained from the results of a statistical analysis. Finally, based on the threshold value, a simple algorithm is presented to identify files that contain web shells in web applications. The experimental results show that compared with other approaches, Evil-hunter can identify web shells more efficiently and accurately.