On the Hamming distances of repeated-root constacyclic codes of length 4ps

Let $p$ be an odd prime, $s$, $m$ be positive integers, $\gamma ,\lambda$ be nonzero elements of the finite field ${\mathbb{F}}_{p^m}$ such that ${\gamma }^{p^s}=\lambda$. In this paper, we show that, for any positive integer $\eta$, the Hamming distances of all repeated-root $\lambda$-constacyclic codes of length $\eta p^s$ can be determined by those of certain simple-root $\gamma$-constacyclic codes of length $\eta$. Using this result, Hamming distances of all constacyclic codes of length $4p^s$ are obtained. As an application, we identify all MDS $\lambda$-constacyclic codes of length $4p^s$.     

Gray codes extending quadratic matchings

Is it true that every matching in the n-dimensional hypercube can be extended to a Gray code? More than two decades have passed since Ruskey and Savage asked this question and the problem still remains open. A solution is known only in some special cases, including perfect matchings or matchings of linear size. This article shows that the answer to the Ruskey–Savage problem is affirmative for every matching of size at most . The proof is based on an inductive construction that extends balanced matchings in the completion of the hypercube by edges of into a Hamilton cycle of . On the other hand, we show that for every there is a balanced matching in of size that cannot be extended in this way.     

The dual code of any (δ+αu2)-constacyclic code over F2m[u]∕〈u4〉 of oddly even length

Let ${\mathbb{F}}_{2^m}$ be a finite field of cardinality $2^m$, $R={\mathbb{F}}_{2^m}\left[u\right]∕〈u^4〉={\mathbb{F}}_{2^m}+u{\mathbb{F}}_{2^m}+u^2{\mathbb{F}}_{2^m}+u^3{\mathbb{F}}_{2^m}$ $(u^4=0)$ which is a finite chain ring, and $n$ is an odd positive integer. For any $\delta ,\alpha \in {\mathbb{F}}_{2^m}^{\times }$, an explicit representation for the dual code of any $(\delta +\alpha u^2)$-constacyclic code over $R$ of length $2n$ is given. And some dual codes of $(1+u^2)$-constacyclic codes over $R$ of length 14 are constructed. For the case of $\delta =1$, all distinct self-dual $(1+\alpha u^2)$-constacyclic codes over $R$ of length $2n$ are determined.     

A velocity program using the Kanade–Lucas–Tomasi feature-tracking algorithm with demonstration for pressure and electroosmosis conditions

Investigating microfluidic flow profiles is of interest in the microfluidics field for the determination of various characteristics of a lab-on-a-chip system. Microparticle tracking velocimetry uses computational methods upon recording video footage of microfluidic flow to ultimately visualize motion within a microfluidic system across all frames of a video. Current methods are computationally expensive or require extensive instrumentation. A computational method suited to microparticle tracking applications is the robust Kanade–Lucas–Tomasi (KLT) feature-tracking algorithm. This work explores a microparticle tracking velocimetry program using the KLT feature-tracking algorithm. The developed program is demonstrated using pressure-driven and EOF and compared with the respective mathematical fluid flow models. An electrostatics analysis of EOF conditions is performed in the development of the mathematical using a Poisson's Equation solver. This analysis is used to quantify the zeta potential of the electroosmotic system. Overall, the KLT feature-tracking algorithm presented in this work proved to be highly reliable and computationally efficient for investigations of pressure-driven and EOF in a microfluidic system.     

级联光栅结合Sagnac环的可调谐光纤激光器

提出并验证了一种单-双波长可调谐掺铒光纤激光器。利用级联光纤布拉格光栅(Cascaded Fiber Bragg gratings,Cascaded FBGs)结合Sagnac环结构所产生的复合滤波效应,实现较高精细度滤波,并通过调节环内偏振控制器(Polarization Controller,PC),引入双折射效应,得到波长可调谐的光纤激光器。基于耦合模理论并使用传输矩阵法对该结构的传输特性进行了分析,在此基础上搭建实验系统,验证了理论分析的正确性。实验结果表明:通过调节PC,激光器输出激光的波长范围约为1 555.644～1 556.112 nm,双波长间隔的可调范围约为0.108～0.452 nm,单-双波长的边模抑制比(SMSR)均高于40 dB;在稳定性测试中,输出单-双波长激光的波长最大漂移量小于0.008 nm。该方法具有结构简单、调谐方便、易于实现且精细度较高的优点,可应用于密集波分复用及全光通信系统等领域。