102,974 research outputs found
Perfect Mannheim, Lipschitz and Hurwitz weight codes
In this paper, upper bounds on codes over Gaussian integers, Lipschitz
integers and Hurwitz integers with respect to Mannheim metric, Lipschitz and
Hurwitz metric are given.Comment: 21 page
A Penalty Approach to Differential Item Functioning in Rasch Models
A new diagnostic tool for the identification of differential item functioning (DIF) is proposed. Classical approaches to DIF allow to consider only few subpopulations like ethnic groups when investigating if the solution of items depends on the membership to a subpopulation. We propose an explicit model for differential item functioning that includes a set of variables, containing metric as well as categorical components, as potential candidates for inducing DIF. The ability to include a set of covariates entails that the model contains a large number of parameters. Regularized estimators, in particular penalized maximum likelihood estimators, are used
to solve the estimation problem and to identify the items that induce DIF. It is shown that the method is able to detect items with DIF. Simulations and two applications demonstrate the applicability of the method
Looking for a quick ļ¬x: How weak social auditing is keeping workers in sweatshop
CCC_05_quick_fix.pdf: 4178 downloads, before Oct. 1, 2020
Characterisation of a family of neighbour transitive codes
We consider codes of length over an alphabet of size as subsets of
the vertex set of the Hamming graph . A code for which there
exists an automorphism group that acts transitively on the
code and on its set of neighbours is said to be neighbour transitive, and were
introduced by the authors as a group theoretic analogue to the assumption that
single errors are equally likely over a noisy channel. Examples of neighbour
transitive codes include the Hamming codes, various Golay codes, certain
Hadamard codes, the Nordstrom Robinson codes, certain permutation codes and
frequency permutation arrays, which have connections with powerline
communication, and also completely transitive codes, a subfamily of completely
regular codes, which themselves have attracted a lot of interest. It is known
that for any neighbour transitive code with minimum distance at least 3 there
exists a subgroup of that has a -transitive action on the alphabet over
which the code is defined. Therefore, by Burnside's theorem, this action is of
almost simple or affine type. If the action is of almost simple type, we say
the code is alphabet almost simple neighbour transitive. In this paper we
characterise a family of neighbour transitive codes, in particular, the
alphabet almost simple neighbour transitive codes with minimum distance at
least , and for which the group has a non-trivial intersection with the
base group of . If is such a code, we show that, up to
equivalence, there exists a subcode that can be completely described,
and that either , or is a neighbour transitive frequency
permutation array and is the disjoint union of -translates of .
We also prove that any finite group can be identified in a natural way with a
neighbour transitive code.Comment: 30 Page
- ā¦