位置：成果数据库 > 期刊 > 期刊详情页
码重为3和7的最优光正交码的具体构造
  • ISSN号：1000-0984
  • 期刊名称：《数学的实践与认识》
  • 时间：0
  • 分类：O157.5[理学—数学;理学—基础数学]
  • 作者机构：[1]百色学院数学与统计学院,广西百色533000, [2]福州大学离散数学研究中心,福建福州350002
  • 相关基金：国家自然科学基金（61170308）;广西自然科学基金（2013GXNSFAA019022）;广西高校科研项目（2013YB246）;百色学院科研基金项目（2012KB01）
作者： 黄必昌[1,2], 黄勇[2]
关键词： 常重量光正交码, 变重量光正交码, 循环填充, 二次剩余, constant-weight optical orthogonal codes, variable-weight optical orthogonalcodes, cyclic packing, quadratic residue
中文摘要：

对光正交码（OOC）构造的关注源于它在光码分多址网络中有许多应用.截至目前,对于码重为W∈{{3,4},{3,5},{3,6},{4,5},{4,6]}的变重量光正交码的构造已经取得许多结果.然而,对于码重为W={3,7}的变重量光正交码的具体构造非常的少.给出一系列新的最优变重量光正交码（33p,{3,7},1,{4/5,1/5}）-OOC的具体构造,对于任何素数p≡3（mod 4）且p≥7.

英文摘要：

Constructing optical orthogonal codes （OOC） cause for many researchers concern because it has many applications in the optical code division multiple access （OCDMA） net- work. So far, much works have been devoted to optimal variable-weight （n, W, 1, Q）-OOC with W e {{3, 4}, {3, 5}, {3, 6}, {4, 5}, {4, 6}}. However, explicit constructions of optimal （n, W, 1, Q）-OOC with W = {3, 7} are very few. In this paper, an infinite class of explicit constructions of new optimal variable-weight （33p, {3, 7}, 1, {4/5,1/5））-OOC are presented, for any prime p ---- 3 （mod 4） and p 〉 7.

同期刊论文项目
超大规模集成电路布局的ell-1模优化模型及其算法研究
期刊论文 48 会议论文 1 获奖 1
同项目期刊论文
A GRASP algorithm for multi-objective circuit partitioning
A discrete dynamic convexized method for the max-cut problem
An analytical placer for VLSI standard cell placement
A derivative-free variant called DFSA of Dekkers and Aarts' continuous simulated annealing algo
VLSI电路划分问题的分散搜索算法
Pareto局部搜索算法的改进
A memetic algorithm for hardware software partitioning
A discrete dynamic convexized method for VLSI circuit partitioning
An alternating direction method for nash equilibrium of two-person games with alternating offers
A penalty function-based differential evolution algorithm for nonlinearly constrained global optimiz
An effective placer for large-scale mixed-size circuit placement
Combining clustered adaptive multi-start and discrete dynamic convexized methods for the max-cut pro
A placement flow for very large-scale mixed-size circuit placement
多维背包问题的变邻域填充函数算法
求解VLSI不可二划分布图规划问题的混合遗传算法
A method for detecting community structure in complex networks  
一种用于并行电路仿真的电路划分算法
A penalty decomposition method for the optimization problem with two $l_0$ norm constraints
求解VLSI标准单元布局问题的增强型遗传模拟退火算法
Solving the weighted MAX-SAT problem using the dynamic convexized method
A partial inexact alternating direction method for structured variational inequalities
VLSI等宽标准单元阵列布局问题的一个高效遗传算法
On a local search algorithm for the capacitated max-k-cut problem
A tabu search-based memetic algorithm for hardware/software partitioning
An augmented Lagrangian method for VLSI global placement
Nesterov's smoothing and excessive gap methods for an optimization problem in VLSI placement
An efficient memetic algorithm for solving the max-bisection problem
Speeding up a memetic algorithm for the max-bisection problem
An improvement of the penalty decomposition method for sparse approximation
Nonsmooth optimization method for VLSI global placement
A proximal alternating direction method of multipliers for a minimization problem with nonconvex con
The robust constant and its applications in random global search for unconstrained global optimizati
An effective discrete dynamic convexized method for solving the winner determination problem
The placement model and its nonlinear placement solver for VLSI global placement
A heuristic algorithm for the strip packing problem
一种求解最大二等分问题的分散搜索算法
求解可分离凸优化问题的非精确混合分裂算法
最优冲突回避码的具体构造
VLSI标准单元阵列布局问题的一个高效遗传算法
一种求解同时博弈Nash平衡问题的非线性Jacobi算法
A HOMOTOPY-BASED ALTERNATING DIRECTION METHOD OF MULTIPLIERS FOR STRUCTURED CONVEX OPTIMIZATION＊t
期刊信息
  • 《数学的实践与认识》
  • 中国科技核心期刊
  • 主管单位:中国科学院
  • 主办单位:中国科学院数学与系统科学研究院
  • 主编：林群
  • 地址：北京大学数学科学学院
  • 邮编：100871
  • 邮箱：bjmath@math.pku.edu.cn
  • 电话：010-62759981
  • 国际标准刊号：ISSN：1000-0984
  • 国内统一刊号：ISSN：11-2018/O1
  • 邮发代号:2-809
  • 获奖情况:
  • 国内外数据库收录:
  • 美国数学评论（网络版）,德国数学文摘,中国中国科技核心期刊,中国北大核心期刊（2004版）,中国北大核心期刊（2008版）,中国北大核心期刊（2011版）,中国北大核心期刊（2014版）,中国北大核心期刊（2000版）
  • 被引量:22973