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.     

SCMA场景下的极化码编解码方案改进研究

极化码是目前唯一一种被证明可达到信道容量的编码方式,稀疏码分多址接入(Sparse Code Division Multiple Access,SCMA)可以提高频谱资源的利用率和接入系统的用户接入数量。为了提升SCMA与极化码的联合系统的误码率性能和译码时延,使联合系统的应用越来越广泛,提出了2种降低译码复杂度的方式:简化的左信息更新方式和剪枝译码算法。简化的左信息更新方式对于N=256,N=1024的极化码分别能降低37.6%和44.6%的存储资源占用数;剪枝译码算法在码率为0.5时能降低50%左右的计算复杂度。基于简化的SCAN算法改进了联合检测译码算法,在接收机采用外循环迭代的结构,引入了阻尼机制,选取最优的阻尼方式和最优阻尼值。仿真分析了所提联合检测译码算法与原有联合检测译码算法的误码率性能差异,外迭代接收机性能与内外双循环迭代的接收机性能相同,采用阻尼机制联合接收机的性能比无阻尼接收机的性能高0.8 dB左右,SJIDD的误帧率性能比保留宽度为32的SCLJDD的性能低0.7 dB左右,但能使接收机处理时延降至原来的1/4~1/8。     

Linear codes associated to skew-symmetric determinantal varieties

In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum distances of these codes are determined and a recursive formula for the weight of a general codeword in these codes is given.     

管式炉中半导体激光器巴条Au80Sn20焊料封装研究

为了提高半导体激光器的封装质量和效率,引入管式炉利用夹具进行批量封装。由于封装质量的好坏直接影响半导体激光器的输出特性和使用寿命,利用MOCVD生长808 nm芯片,重点分析了管式炉温度和封装时间对半导体激光器巴条双面金锡封装质量的影响。利用X射线检测、结电压、光电特性参数和smile效应测试手段,确定了管式炉封装半导体激光器巴条的最优封装条件,为以后的产业化提供了指导意义。     

New lower bounds on the size of (n,r)‐arcs in PG(2,q)

An $\left(n,r\right)$‐arc in $\text{PG}\left(2,q\right)$ is a set of $n$ points such that each line contains at most $r$ of the selected points. It is well known that $\left(n,r\right)$‐arcs in $\text{PG}\left(2,q\right)$ correspond to projective linear codes. Let $m_r\left(2,q\right)$ denote the maximal number $n$ of points for which an $\left(n,r\right)$‐arc in $\text{PG}\left(2,q\right)$ exists. In this paper we obtain improved lower bounds on $m_r\left(2,q\right)$ by explicitly constructing $\left(n,r\right)$‐arcs. Some of the constructed $\left(n,r\right)$‐arcs correspond to linear codes meeting the Griesmer bound. All results are obtained by integer linear programming.     

Optimising the Termofluids CFD code for petascale simulations

ABSTRACT

This paper presents some recent efforts carried out on the expansion of the scalability of TermoFluids multi-physics Computational Fluid Dynamics (CFD) code, aiming to achieve petascale capacity for a single simulation. We describe different aspects that we have improved in our code in order to efficiently run it on 131,072 CPU-cores. This work has been developed using the BlueGene/Q Mira supercomputer of the Argonne Leadership Computing Facility, where we have obtained feedback at the targeted scale. In summary, this is a practical paper showing our experience at reaching the petascale paradigm for a single simulation with TermoFluids.