|
|
发表于 2025-12-2 18:15:48
|
显示全部楼层
成电刘姝副教授，12篇TIT，今年才拿到博导资格，这水平不吊锤这个来养老的？
' G4 O" A, m' l- C( [0 S5 |% Z. k. sEncoding and Decoding of Reed–Muller Codes With Quasi-Linear Complexity3 y# U3 F* i1 I& p( f8 k
Yi Kuang;2 S/ b$ j8 ^2 B' A1 T+ o
Songsong Li;
4 D Q6 Q s7 O: FShu Liu;
' R" q' z! Z! p% v# cLiming Ma;
! | h0 K! @9 X) a4 vChaoping Xing; A( H/ [. R9 ^0 P: \, K
IEEE Transactions on Information Theory: B- ]) H7 O5 `9 a
Year: 2025 | Volume: 71, Issue: 12 | Journal Article | Publisher: IEEE
( h/ [7 b' {1 v3 l# {9 [' m& G% H9 b7 m8 i! f3 n0 ]- {) r
Abstract
: ^# M5 J* C$ lHTML6 M' |+ {/ r0 W7 y, }) A/ h
0 V R* e# I! u: |
Encoding of Algebraic Geometry Codes With Quasi-Linear Complexity O(NlogN)9 f1 j2 U- }8 }+ n3 N' S& Y
Songsong Li;- L3 V' k2 {# O
Shu Liu;# o/ f; i! v# ~8 E! b% B. ]! w
Liming Ma;: Y* j' Q1 Z+ x+ s X7 |
Yunqi Wan;
' P& ~, S, u% s9 W. ZChaoping Xing
+ g \$ i( X) W. x" h' PIEEE Transactions on Information Theory
9 _* Q5 Q8 H( |' mYear: 2025 | Volume: 71, Issue: 7 | Journal Article | Publisher: IEEE" E0 {7 M; ^2 \ }' v$ D
: V! U! D8 X+ A) I( r+ e0 {Abstract% {1 F2 ]# D! w; }
HTML2 F2 V, U" P) z- {& J- n9 d& y
5 v( O/ h9 D/ W
Explicit Construction of q-Ary 2-Deletion Correcting Codes With Low Redundancy
( Z+ U" W% n1 }, O% ^Shu Liu;' w8 Q" n' J' J* I5 j& Q
Ivan Tjuawinata;
9 c% U, ?/ s/ `, pChaoping Xing
* B+ }6 f" J7 iIEEE Transactions on Information Theory
+ E1 t7 z+ \# ?2 E5 h( lYear: 2024 | Volume: 70, Issue: 6 | Journal Article | Publisher: IEEE
* O! e- M- p& I7 `, E" kCited by: Papers (4)
( J6 I, E" \6 g/ @3 L: p" P
( G5 G4 o" e: t6 m# ~" D |1 e3 ^" cAbstract- B, f/ F" b2 S
HTML
: M9 I6 }0 E: J& ~8 s( Z1 `6 K1 M; [0 j T5 {, l
A Lower Bound on the List-Decodability of Insdel Codes
9 ~/ T% i, ?( x; X1 tShu Liu;
5 }2 q5 E) g$ ?) W' w" u/ XIvan Tjuawinata;
0 s" v4 u1 s- H5 rChaoping Xing3 B8 b B, A T& E: D3 k4 ~
IEEE Transactions on Information Theory
7 ^" x v# ~8 H: M* A& UYear: 2023 | Volume: 69, Issue: 11 | Journal Article | Publisher: IEEE
- K/ S& W6 t8 t s7 V% `, V
- [% L9 }) U s/ G3 r4 vAbstract
% _5 L7 i; Q5 A" p$ ?( oHTML' s+ @* i3 I" r) A
( f( a) Q% u; `8 m" T b1 yA New Construction of Nonlinear Codes via Algebraic Function Fields, T; ^* I+ k+ Q0 I/ D
Shu Liu;
+ `, f! Q. b& ?& aLiming Ma;
% q* Q" W6 D: ?+ G$ ?Ting-Yi Wu;
, p" n- t; ]- c. Z' h9 w# x" HChaoping Xing
6 U3 I/ u( ]) a1 \' m9 vIEEE Transactions on Information Theory% e# ^; U2 C, ^2 ]! N0 {
Year: 2023 | Volume: 69, Issue: 9 | Journal Article | Publisher: IEEE F, B* C* P0 s8 _$ K
Cited by: Papers (1)
: e+ c% X1 Q% {5 b, U3 E* J% f0 a* c3 N& P. f9 s' b
Abstract
7 O+ T# @6 \; \$ F- b; AHTML
$ [1 z* p p. T- o) y& Y6 H$ |- o6 C* u9 K; w
Maximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems
' G+ k7 C4 a0 S* u4 u) sShu Liu;
) G/ @4 k' B6 tChaoping Xing* S+ h6 {( w! x! @7 ^
IEEE Transactions on Information Theory
2 v; A+ l% z" rYear: 2023 | Volume: 69, Issue: 4 | Journal Article | Publisher: IEEE
" S1 J& ]/ m8 h3 k8 l5 SCited by: Papers (2)
, {3 K; [0 r+ O
- H% _" n' w& i0 p6 l* \* p7 fAbstract
8 u3 f8 u x9 zHTML
) S5 _ D& K1 A9 |+ ~3 k4 ?/ R
Bounds and Constructions for Insertion and Deletion Codes
/ t: c2 y! }& h( i* {% d& UShu Liu;2 n( A; L# g6 [8 P7 |
Chaoping Xing0 b: A8 ~# }$ E& i1 w
IEEE Transactions on Information Theory- R0 [9 b/ V& m2 c' e
Year: 2023 | Volume: 69, Issue: 2 | Journal Article | Publisher: IEEE" v8 j, ?9 K! M' M$ \& b3 P
Cited by: Papers (14)
. c2 G7 B4 E6 I7 ?; h2 e7 ]1 u( _7 j5 j$ p: {/ C
Abstract
B0 w6 z. |7 }) J6 k$ _HTML1 o# Z' r3 e) A8 E: E
( \7 r1 l& V1 M
Efficiently List-Decodable Insertion and Deletion Codes via Concatenation. K* U3 {: g/ D: t+ I3 a1 y
Shu Liu;( n* ^: `1 ~$ Z9 _( W1 l
Ivan Tjuawinata;# d5 A- Z& p( J* b. |8 B" P
Chaoping Xing4 d! [ b/ Z# `+ i5 X
IEEE Transactions on Information Theory2 l* Q; s( W' x0 O5 v1 X. i; L0 [5 O
Year: 2021 | Volume: 67, Issue: 9 | Journal Article | Publisher: IEEE5 J' X. K4 e5 P: [0 O+ S% Q
Cited by: Papers (6)/ H! F. A% j. d- J
' ?6 \% R7 D& I% @Abstract
# k' W/ ]( w5 `5 K/ q! @) U( DHTML
* o$ w. C$ A0 {+ V5 [# k0 T% @! p) z
/ U. J6 J/ P. ^$ F4 E& BExplicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime
; r" F$ `, x7 i* {4 ZTai Do Duc;
' ?0 C6 `5 U& b& L1 l" v5 b. BShu Liu;
+ x6 ~) j) }; O6 D" Z/ \- WIvan Tjuawinata;: _) t( ]' m: Q, Q. W9 L1 y
Chaoping Xing" n) _7 d9 B" ~2 Y3 u2 E+ |* J
IEEE Transactions on Information Theory
- ?! r t# _3 A: l9 dYear: 2021 | Volume: 67, Issue: 5 | Journal Article | Publisher: IEEE/ y& T, g8 `/ j! E1 ^
Cited by: Papers (17)
8 U/ ]# r. w: Z; G3 D" s5 r0 d2 u( d2 n1 e7 @3 o8 }# _5 Y: h6 g1 V0 K
Abstract* _2 a5 B2 N% T+ W5 m( i2 D
HTML
7 `* R: L6 [0 n8 |# k& M( w, N
& z! R4 w" d) {* I; `List Decodability of Symbol-Pair Codes5 A; H4 B6 b% l2 ~
Shu Liu;
, `- q& t* u [3 d4 c2 ~Chaoping Xing;: V6 R8 f4 V* H3 r6 o; ]5 H
Chen Yuan
% j6 P& [+ M) W( J3 nIEEE Transactions on Information Theory) ?7 E" }! h0 I" S4 W$ I8 e" C, J3 i- \
Year: 2019 | Volume: 65, Issue: 8 | Journal Article | Publisher: IEEE
/ l0 i% m) {" K' |& HCited by: Papers (15)' S) I) ?! p0 D0 {% h
3 `' s) A- k$ ^4 j
Abstract
$ K5 ?9 }" a# j& |3 HHTML
5 F9 Z, i5 F& _% c2 I% g8 j3 e) I+ c7 l+ x! O+ O: d
List Decoding of Cover Metric Codes Up to the Singleton Bound
# a- H" _# t5 g- e9 O6 fShu Liu;
+ S5 m+ a3 T; F9 |! D& ZChaoping Xing;
. q- G. i- A! ]) g3 B, e4 OChen Yuan# S4 g" G8 @9 Y. @
IEEE Transactions on Information Theory
9 f5 t% s0 y( x" kYear: 2018 | Volume: 64, Issue: 4 | Journal Article | Publisher: IEEE4 H0 Z2 o" a g
Cited by: Papers (7)
: E s, t6 Y( w9 H; p1 l& \( y; q# ^
Abstract
6 e1 {& e8 Y4 kHTML
/ t, C" _% E. k
" z* h4 ^9 h* t' I, C8 ]List Decodability of Random Subcodes of Gabidulin Codes5 z& F: F$ z' {0 I+ S
Shu Liu;0 u& S r& E2 t- I# U
Chaoping Xing;
; q) V* w0 Q$ D7 i- Q5 IChen Yuan
5 ?( V4 G/ h1 m; r0 G5 E* hIEEE Transactions on Information Theory/ s. _8 ~+ o0 A/ |' M) H
Year: 2017 | Volume: 63, Issue: 1 | Journal Article | Publisher: IEEE
; E6 C1 y, G1 ~& ICited by: Papers (5)! e2 O% R4 }/ u
|
|
[复制链接]
发表于 2025-12-2 11:45:36
楼主