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 im...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.展开更多
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...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.展开更多
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 ne...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.展开更多
In a recent paper, Hu et al. defined the complete weight distributions of quantum codes and proved the Mac Williams identities, and as applications they showed how such weight distributions may be used to obtain the s...In a recent paper, Hu et al. defined the complete weight distributions of quantum codes and proved the Mac Williams identities, and as applications they showed how such weight distributions may be used to obtain the singleton-type and hamming-type bounds for asymmetric quantum codes. In this paper we extend their study much further and obtain several new results concerning the complete weight distributions of quantum codes and applications. In particular, we provide a new proof of the Mac Williams identities of the complete weight distributions of quantum codes. We obtain new information about the weight distributions of quantum MDS codes and the double weight distribution of asymmetric quantum MDS codes. We get new identities involving the complete weight distributions of two different quantum codes. We estimate the complete weight distributions of quantum codes under special conditions and show that quantum BCH codes by the Hermitian construction from primitive, narrow-sense BCH codes satisfy these conditions and hence these estimate applies.展开更多
In 1993, Alabhadi and Wicker gave a modification to Xinmei Digital Signature Scheme based on error-correcting codes, which is usually denoted by AW Scheme. In this paper we show that the AW Scheme is actually not secu...In 1993, Alabhadi and Wicker gave a modification to Xinmei Digital Signature Scheme based on error-correcting codes, which is usually denoted by AW Scheme. In this paper we show that the AW Scheme is actually not secure: anyone holding public keys of the signatory can obtain the equivalent private keys, and then forge digital signatures for arbitrary messages successfully. We also point out that one can hardly construct a digital signature scheme with high-level security due to the difficulty of decomposing large matrixes.展开更多
In this paper, we analyze the video steganography technique, which is used to ensure national security and the confidentiality of the information of governmental agencies and enterprises. Videos may be used to transmi...In this paper, we analyze the video steganography technique, which is used to ensure national security and the confidentiality of the information of governmental agencies and enterprises. Videos may be used to transmit secrets and conduct covert communication. As such, we present an algorithm based on a secret sharing scheme and an Error-Correcting Code（ECC）, which combines Grey Relational Analysis（GRA） with a partition mode in video compression standard H.264/AVC. First, we process secret information by secret sharing, and then use an ECC to process the obtained information. Moreover, we choose the Discrete Cosine Transform（DCT） blocks using GRA, and then use rules to hide the pretreated information in DCT coefficients of the video frames. Experimental results indicate that our algorithm has good invisibility, better robustness, good anti-steganalysis ability, and little influence on the bit rate of the video carrier. In addition, the bit error rate is low after attacks such as noise, filtering,or frame loss in the simulation environment.展开更多
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 theor...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.展开更多
In this paper, the cyclic code of the classic circuit is transformed and transplanted; then, the quantum encoding scheme based on cyclic code and quantum error-correction circuit is constructed. The proposed circuit c...In this paper, the cyclic code of the classic circuit is transformed and transplanted; then, the quantum encoding scheme based on cyclic code and quantum error-correction circuit is constructed. The proposed circuit can correct one-bit error, and the use of redundant bits to encode more than one-bit quantum information breaks the previous limitations of many bits encoding a quantum bit. Compared with the existing coding circuits （Shor code, Steane code and five stable subcode）, it shows obvious superiority in the quantum coding efficiency and transmission efficiency.展开更多
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 propertie...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.展开更多
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 differen...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.展开更多
In the article“Deep Learning-Enhanced Brain Tumor Prediction via Entropy-Coded BPSO in CIELAB Color Space”by Mudassir Khalil,Muhammad Imran Sharif,Ahmed Naeem,Muhammad Umar Chaudhry,Hafiz Tayyab Rauf,Adham E.Ragab C...In the article“Deep Learning-Enhanced Brain Tumor Prediction via Entropy-Coded BPSO in CIELAB Color Space”by Mudassir Khalil,Muhammad Imran Sharif,Ahmed Naeem,Muhammad Umar Chaudhry,Hafiz Tayyab Rauf,Adham E.Ragab Computers,Materials&Continua,2023,Vol.77,No.2,pp.2031–2047.DOI:10.32604/cmc.2023.043687,URL:https://www.techscience.com/cmc/v77n2/54831,there was an error regarding the affiliation for the author Hafiz Tayyab Rauf.Instead of“Centre for Smart Systems,AI and Cybersecurity,Staffordshire University,Stoke-on-Trent,ST42DE,UK”,the affiliation should be“Independent Researcher,Bradford,BD80HS,UK”.展开更多
A two-stage algorithm based on deep learning for the detection and recognition of can bottom spray codes and numbers is proposed to address the problems of small character areas and fast production line speeds in can ...A two-stage algorithm based on deep learning for the detection and recognition of can bottom spray codes and numbers is proposed to address the problems of small character areas and fast production line speeds in can bottom spray code number recognition.In the coding number detection stage,Differentiable Binarization Network is used as the backbone network,combined with the Attention and Dilation Convolutions Path Aggregation Network feature fusion structure to enhance the model detection effect.In terms of text recognition,using the Scene Visual Text Recognition coding number recognition network for end-to-end training can alleviate the problem of coding recognition errors caused by image color distortion due to variations in lighting and background noise.In addition,model pruning and quantization are used to reduce the number ofmodel parameters to meet deployment requirements in resource-constrained environments.A comparative experiment was conducted using the dataset of tank bottom spray code numbers collected on-site,and a transfer experiment was conducted using the dataset of packaging box production date.The experimental results show that the algorithm proposed in this study can effectively locate the coding of cans at different positions on the roller conveyor,and can accurately identify the coding numbers at high production line speeds.The Hmean value of the coding number detection is 97.32%,and the accuracy of the coding number recognition is 98.21%.This verifies that the algorithm proposed in this paper has high accuracy in coding number detection and recognition.展开更多
The care of a patient involved in major trauma with exsanguinating haemorrhage is time-critical to achieve definitive haemorrhage control,and it requires coordinated multidisciplinary care.During initial resuscitation...The care of a patient involved in major trauma with exsanguinating haemorrhage is time-critical to achieve definitive haemorrhage control,and it requires coordinated multidisciplinary care.During initial resuscitation of a patient in the emergency department(ED),Code Crimson activation facilitates rapid decisionmaking by multi-disciplinary specialists for definitive haemorrhage control in operating theatre(OT)and/or interventional radiology(IR)suite.Once this decision has been made,there may still be various factors that lead to delay in transporting the patient from ED to OT/IR.Red Blanket protocol identifies and addresses these factors and processes which cause delay,and aims to facilitate rapid and safe transport of the haemodynamically unstable patient from ED to OT,while minimizing delay in resuscitation during the transfer.The two processes,Code Crimson and Red Blanket,complement each other.It would be ideal to merge the two processes into a single protocol rather than having two separate workflows.Introducing these quality improvement strategies and coor-dinated processes within the trauma framework of the hospitals/healthcare systems will help in further improving the multi-disciplinary care for the complex trauma patients requiring rapid and definitive haemorrhage control.展开更多
Fraction repetition(FR)codes are integral in distributed storage systems(DSS)with exact repair-by-transfer,while pliable fraction repetition codes are vital for DSSs in which both the per-node storage and repetition d...Fraction repetition(FR)codes are integral in distributed storage systems(DSS)with exact repair-by-transfer,while pliable fraction repetition codes are vital for DSSs in which both the per-node storage and repetition degree can easily be adjusted simultaneously.This paper introduces a new type of pliable FR codes,called absolute balanced pliable FR(ABPFR)codes,in which the access balancing in DSS is considered.Additionally,the equivalence between pliable FR codes and resolvable transversal packings in combinatorial design theory is presented.Then constructions of pliable FR codes and ABPFR codes based on resolvable transversal packings are presented.展开更多
Multilevel coding(MLC)is a commonly used polar coded modulation scheme,but challenging to implement in engineering due to its high complexity and long decoding delay for high-order modulations.To address these limitat...Multilevel coding(MLC)is a commonly used polar coded modulation scheme,but challenging to implement in engineering due to its high complexity and long decoding delay for high-order modulations.To address these limitations,a novel two-level serially concatenated MLC scheme,in which the bitlevels with similar reliability are bundled and transmitted together,is proposed.The proposed scheme hierarchically protects the two bit-level sets:the bitlevel sets at the higher level are sufficiently reliable and do not require excessive resources for protection,whereas only the bit-level sets at the lower level are encoded by polar codes.The proposed scheme has the advantages of low power consumption,low delay and high reliability.Moreover,an optimized constellation signal labeling rule that can enhance the performance is proposed.Finally,the superiority of the proposed scheme is validated through the theoretical analysis and simulation results.Compared with the bit interleaving coding modulation(BICM)scheme,under 256-quadrature amplitude modulation(QAM),the proposed scheme attains a performance gain of 1.0 dB while reducing the decoding complexity by 54.55%.展开更多
In this paper,we first generalize the constant dimension and orbit codes over finite fields to the constant rank and orbit codes over finite chain rings.Then we provide a relationship between constant rank codes over ...In this paper,we first generalize the constant dimension and orbit codes over finite fields to the constant rank and orbit codes over finite chain rings.Then we provide a relationship between constant rank codes over finite chain rings and constant dimension codes over the residue fields.In particular,we prove that an orbit submodule code over a finite chain ring is a constant rank code.Finally,for special finite chain ring F_(q)+γF_(q),we define a Gray mapφfrom(F_(q)+γF_(q))^(n)to F^(2n)_(q),and by using cyclic codes over F_(q)+γF_(q),we obtain a method of constructing an optimum distance constant dimension code over F_(q).展开更多
基金Project supported by the National Natural Science Foundation of China (Grant No. 61072071)
文摘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.
基金This work was supported in part by the National Science Foundation of China(No.61772539,6187212,61972405),STITSX(No.201705D131025),1331KITSX,and CiCi3D.
文摘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.
基金Project supported by the National Natural Science Foundation of China (Grant Nos 60773085 and 60801051)the NSFC-KOSEF International Collaborative Research Funds (Grant Nos 60811140346 and F01-2008-000-10021-0)
文摘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.
基金the National Natural Science Foundation of China (Grant Nos. 61972413, 61901525, and 62002385)the National Key R&D Program of China (Grant No. 2021YFB3100100)RGC under Grant No. N HKUST619/17 from Hong Kong, China。
文摘In a recent paper, Hu et al. defined the complete weight distributions of quantum codes and proved the Mac Williams identities, and as applications they showed how such weight distributions may be used to obtain the singleton-type and hamming-type bounds for asymmetric quantum codes. In this paper we extend their study much further and obtain several new results concerning the complete weight distributions of quantum codes and applications. In particular, we provide a new proof of the Mac Williams identities of the complete weight distributions of quantum codes. We obtain new information about the weight distributions of quantum MDS codes and the double weight distribution of asymmetric quantum MDS codes. We get new identities involving the complete weight distributions of two different quantum codes. We estimate the complete weight distributions of quantum codes under special conditions and show that quantum BCH codes by the Hermitian construction from primitive, narrow-sense BCH codes satisfy these conditions and hence these estimate applies.
基金This work was supported by the National Key Foundation Research "973" Project (Grant No.G1999035802) and National Science Fund for Distinguished Young Scholars (Grant No. 60025205).
文摘In 1993, Alabhadi and Wicker gave a modification to Xinmei Digital Signature Scheme based on error-correcting codes, which is usually denoted by AW Scheme. In this paper we show that the AW Scheme is actually not secure: anyone holding public keys of the signatory can obtain the equivalent private keys, and then forge digital signatures for arbitrary messages successfully. We also point out that one can hardly construct a digital signature scheme with high-level security due to the difficulty of decomposing large matrixes.
基金supported by the National Natural Science Foundation of China(Nos.61379152 and 61403417)
文摘In this paper, we analyze the video steganography technique, which is used to ensure national security and the confidentiality of the information of governmental agencies and enterprises. Videos may be used to transmit secrets and conduct covert communication. As such, we present an algorithm based on a secret sharing scheme and an Error-Correcting Code（ECC）, which combines Grey Relational Analysis（GRA） with a partition mode in video compression standard H.264/AVC. First, we process secret information by secret sharing, and then use an ECC to process the obtained information. Moreover, we choose the Discrete Cosine Transform（DCT） blocks using GRA, and then use rules to hide the pretreated information in DCT coefficients of the video frames. Experimental results indicate that our algorithm has good invisibility, better robustness, good anti-steganalysis ability, and little influence on the bit rate of the video carrier. In addition, the bit error rate is low after attacks such as noise, filtering,or frame loss in the simulation environment.
基金Supported by Trans-century Training Program Foundation for the Talents by the State Education Commission
文摘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.
基金Supported by the National Natural Science Foundation of China (61271122)the Natural Science Foundation of Anhui Province(1208085MF102)
文摘In this paper, the cyclic code of the classic circuit is transformed and transplanted; then, the quantum encoding scheme based on cyclic code and quantum error-correction circuit is constructed. The proposed circuit can correct one-bit error, and the use of redundant bits to encode more than one-bit quantum information breaks the previous limitations of many bits encoding a quantum bit. Compared with the existing coding circuits （Shor code, Steane code and five stable subcode）, it shows obvious superiority in the quantum coding efficiency and transmission efficiency.
文摘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.
文摘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.
文摘In the article“Deep Learning-Enhanced Brain Tumor Prediction via Entropy-Coded BPSO in CIELAB Color Space”by Mudassir Khalil,Muhammad Imran Sharif,Ahmed Naeem,Muhammad Umar Chaudhry,Hafiz Tayyab Rauf,Adham E.Ragab Computers,Materials&Continua,2023,Vol.77,No.2,pp.2031–2047.DOI:10.32604/cmc.2023.043687,URL:https://www.techscience.com/cmc/v77n2/54831,there was an error regarding the affiliation for the author Hafiz Tayyab Rauf.Instead of“Centre for Smart Systems,AI and Cybersecurity,Staffordshire University,Stoke-on-Trent,ST42DE,UK”,the affiliation should be“Independent Researcher,Bradford,BD80HS,UK”.
文摘A two-stage algorithm based on deep learning for the detection and recognition of can bottom spray codes and numbers is proposed to address the problems of small character areas and fast production line speeds in can bottom spray code number recognition.In the coding number detection stage,Differentiable Binarization Network is used as the backbone network,combined with the Attention and Dilation Convolutions Path Aggregation Network feature fusion structure to enhance the model detection effect.In terms of text recognition,using the Scene Visual Text Recognition coding number recognition network for end-to-end training can alleviate the problem of coding recognition errors caused by image color distortion due to variations in lighting and background noise.In addition,model pruning and quantization are used to reduce the number ofmodel parameters to meet deployment requirements in resource-constrained environments.A comparative experiment was conducted using the dataset of tank bottom spray code numbers collected on-site,and a transfer experiment was conducted using the dataset of packaging box production date.The experimental results show that the algorithm proposed in this study can effectively locate the coding of cans at different positions on the roller conveyor,and can accurately identify the coding numbers at high production line speeds.The Hmean value of the coding number detection is 97.32%,and the accuracy of the coding number recognition is 98.21%.This verifies that the algorithm proposed in this paper has high accuracy in coding number detection and recognition.
文摘The care of a patient involved in major trauma with exsanguinating haemorrhage is time-critical to achieve definitive haemorrhage control,and it requires coordinated multidisciplinary care.During initial resuscitation of a patient in the emergency department(ED),Code Crimson activation facilitates rapid decisionmaking by multi-disciplinary specialists for definitive haemorrhage control in operating theatre(OT)and/or interventional radiology(IR)suite.Once this decision has been made,there may still be various factors that lead to delay in transporting the patient from ED to OT/IR.Red Blanket protocol identifies and addresses these factors and processes which cause delay,and aims to facilitate rapid and safe transport of the haemodynamically unstable patient from ED to OT,while minimizing delay in resuscitation during the transfer.The two processes,Code Crimson and Red Blanket,complement each other.It would be ideal to merge the two processes into a single protocol rather than having two separate workflows.Introducing these quality improvement strategies and coor-dinated processes within the trauma framework of the hospitals/healthcare systems will help in further improving the multi-disciplinary care for the complex trauma patients requiring rapid and definitive haemorrhage control.
基金Supported in part by the National Key R&D Program of China(No.2020YFA0712300)NSFC(No.61872353)。
文摘Fraction repetition(FR)codes are integral in distributed storage systems(DSS)with exact repair-by-transfer,while pliable fraction repetition codes are vital for DSSs in which both the per-node storage and repetition degree can easily be adjusted simultaneously.This paper introduces a new type of pliable FR codes,called absolute balanced pliable FR(ABPFR)codes,in which the access balancing in DSS is considered.Additionally,the equivalence between pliable FR codes and resolvable transversal packings in combinatorial design theory is presented.Then constructions of pliable FR codes and ABPFR codes based on resolvable transversal packings are presented.
基金supported by the External Cooperation Program of Science and Technology of Fujian Province,China(2024I0016)the Fundamental Research Funds for the Central Universities(ZQN-1005).
文摘Multilevel coding(MLC)is a commonly used polar coded modulation scheme,but challenging to implement in engineering due to its high complexity and long decoding delay for high-order modulations.To address these limitations,a novel two-level serially concatenated MLC scheme,in which the bitlevels with similar reliability are bundled and transmitted together,is proposed.The proposed scheme hierarchically protects the two bit-level sets:the bitlevel sets at the higher level are sufficiently reliable and do not require excessive resources for protection,whereas only the bit-level sets at the lower level are encoded by polar codes.The proposed scheme has the advantages of low power consumption,low delay and high reliability.Moreover,an optimized constellation signal labeling rule that can enhance the performance is proposed.Finally,the superiority of the proposed scheme is validated through the theoretical analysis and simulation results.Compared with the bit interleaving coding modulation(BICM)scheme,under 256-quadrature amplitude modulation(QAM),the proposed scheme attains a performance gain of 1.0 dB while reducing the decoding complexity by 54.55%.
基金Supported by Research Funds of Hubei Province(D20144401,Q20174503)。
文摘In this paper,we first generalize the constant dimension and orbit codes over finite fields to the constant rank and orbit codes over finite chain rings.Then we provide a relationship between constant rank codes over finite chain rings and constant dimension codes over the residue fields.In particular,we prove that an orbit submodule code over a finite chain ring is a constant rank code.Finally,for special finite chain ring F_(q)+γF_(q),we define a Gray mapφfrom(F_(q)+γF_(q))^(n)to F^(2n)_(q),and by using cyclic codes over F_(q)+γF_(q),we obtain a method of constructing an optimum distance constant dimension code over F_(q).
