New Construction for Constant Dimension Subspace Codes via a Composite Structure

He, Xianmang; Chen, Yindong; Zhang, Zusheng; Zhou, Kai

doi:10.1109/lcomm.2021.3052734

Cited by 14 publications

(4 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…USART asynchronous communication, GPIO setup, DCMI, high-frequency noise removal, and other protocol modules are among the software application modules. Due to space constraints, no detailed introduction is provided [20][21].…”

Section: Zbar Algorithmmentioning

confidence: 99%

Design of Cigarette QR Code Decoding System Based on STM32

Haoran

Chen

Wei

2022

Security and Communication Networks

View full text Add to dashboard Cite

This paper mainly studies the design method of the hardware and software of the cigarette strip QR code decoding based on STM32 microprocessor. This paper expounds the principle of hardware circuit design with STM32F407 microprocessor as the core, analyzes the steps of analyzing the QR code decoding algorithm based on the modular programming idea of C language, and analyzes the result of cigarette-bar QR code decoding. The results of field application show that the system can meet the design requirements of cigarette QR code decoding and improve the recognition rate of two-dimensional code, which has high application value.

show abstract

Section: Zbar Algorithmmentioning

confidence: 99%

Design of Cigarette QR Code Decoding System Based on STM32

Haoran

Chen

Wei

2022

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…Several of them started from Lemma 2.10 and improved Lemma 2.11 and Corollary 2.12, see e.g. [14,16,30,33,34]. We will briefly discuss this possibility in Subsection 3.3.…”

Section: Similar As For Thementioning

confidence: 99%

“…With respect to recent improved constructions we mention e.g. [3,4,9,14,15,16,28,30,31,33,34]. Most of the contained improvements fit into a general framework of a combination of subcodes of a specific shape that we will present here.…”

Section: Introductionmentioning

confidence: 99%

The interplay of different metrics for the construction of constant dimension codes

Kurz¹

2023

AMC

View full text Add to dashboard Cite

<p style='text-indent:20px;'>A basic problem for constant dimension codes is to determine the maximum possible size <inline-formula><tex-math id="M1">\begin{document}$ A_q(n,d;k) $\end{document}</tex-math></inline-formula> of a set of <inline-formula><tex-math id="M2">\begin{document}$ k $\end{document}</tex-math></inline-formula>-dimensional subspaces in <inline-formula><tex-math id="M3">\begin{document}$ \mathbb{F}_q^n $\end{document}</tex-math></inline-formula>, called codewords, such that the subspace distance satisfies <inline-formula><tex-math id="M4">\begin{document}$ d_S(U,W): = 2k-2\dim(U\cap W)\ge d $\end{document}</tex-math></inline-formula> for all pairs of different codewords <inline-formula><tex-math id="M5">\begin{document}$ U $\end{document}</tex-math></inline-formula>, <inline-formula><tex-math id="M6">\begin{document}$ W $\end{document}</tex-math></inline-formula>. Constant dimension codes have applications in e.g. random linear network coding, cryptography, and distributed storage. Bounds for <inline-formula><tex-math id="M7">\begin{document}$ A_q(n,d;k) $\end{document}</tex-math></inline-formula> are the topic of many recent research papers. Providing a general framework we survey many of the latest constructions and show the potential for further improvements. As examples we give improved constructions for the cases <inline-formula><tex-math id="M8">\begin{document}$ A_q(10,4;5) $\end{document}</tex-math></inline-formula>, <inline-formula><tex-math id="M9">\begin{document}$ A_q(11,4;4) $\end{document}</tex-math></inline-formula>, <inline-formula><tex-math id="M10">\begin{document}$ A_q(12,6;6) $\end{document}</tex-math></inline-formula>, and <inline-formula><tex-math id="M11">\begin{document}$ A_q(15,4;4) $\end{document}</tex-math></inline-formula>. We also derive general upper bounds for subcodes arising in those constructions.</p>

show abstract

“…[159,182,183] the authors speak of inserting constructions cf. also [111]. Packings of RMCs constructed in Subsection 5.4 can be exploited as follows:…”

Section: Inserting Constructionsmentioning

confidence: 99%