We prove that self-dual codes exist over all finite commutative Frobenius rings, via their decomposition by the Chinese Remainder Theorem into local rings. We construct non-free self-dual codes under some conditions, using self-dual codes over finite fields, and we also construct free self-dual codes by lifting elements from the base finite field. We generalize the building-up construction for ...

This paper studies the information content of some Ifo indicators. In particular, we investigate whether two Ifo indicators, one on the current business situation, the other on current production development, provide information on revisions of German industrial production. A new feature of our analysis is the construction and use of a real-time dataset. We conclude that the Ifo indicators play...

Dislocations represent one of the more common postoperative complications seen after total hip arthroplasty (THA) with estimates ranging from 0.2 to 7% in primary cases and as high as 25% in revision surgeries [1]. In the early 1970s, Giles Bousquet developed a dual mobility (DM) acetabular cup with the goal of reducing dislocation rates. The dual mobility (DM) design consists of two articulati...

Using [52, 26, 10] binary self-dual codes, possesing an automorphism of order 3, we construct new [54, 27, 10] binary self-dual codes. We do this by applying a technique for extending a [2k, k, d] self-dual code to a [2k+2, k+1] self-dual code. Most of the constructed codes have new values of the parameter in their weight numerators,. We construct new codes with   20, 21, 22 for the first wei...

For lengths 64 and 66, we construct extremal singly even self-dual codes with weight enumerators for which no extremal singly even selfdual codes were previously known to exist. We also construct new 40 inequivalent extremal doubly even self-dual [64, 32, 12] codes with covering radius 12 meeting the Delsarte bound.